Base | Representation |
---|---|
bin | 1101101010000011010111… |
… | …11100000001011010111001 |
3 | 10221100001102012111122121111 |
4 | 12311001223330001122321 |
5 | 12414021442342331301 |
6 | 143512340141240321 |
7 | 6216520315002262 |
oct | 665015374013271 |
9 | 127301365448544 |
10 | 30032222230201 |
11 | 9629659568574 |
12 | 34505425630a1 |
13 | 139b04601a259 |
14 | 75b7d29bb969 |
15 | 371318a61551 |
hex | 1b506bf016b9 |
30032222230201 has 8 divisors (see below), whose sum is σ = 30460047464000. Its totient is φ = 29607166092240.
The previous prime is 30032222230177. The next prime is 30032222230211. The reversal of 30032222230201 is 10203222223003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30032222230201 - 217 = 30032222099129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30032222230211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 692252115 + ... + 692295496.
It is an arithmetic number, because the mean of its divisors is an integer number (3807505933000).
Almost surely, 230032222230201 is an apocalyptic number.
It is an amenable number.
30032222230201 is a deficient number, since it is larger than the sum of its proper divisors (427825233799).
30032222230201 is a wasteful number, since it uses less digits than its factorization.
30032222230201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1384547919.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 30032222230201 its reverse (10203222223003), we get a palindrome (40235444453204).
The spelling of 30032222230201 in words is "thirty trillion, thirty-two billion, two hundred twenty-two million, two hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •