Base | Representation |
---|---|
bin | 101100000110000110101… |
… | …011010101111010111101 |
3 | 101201200111122110002021012 |
4 | 230012012223111322331 |
5 | 344121333112440410 |
6 | 10240020535445005 |
7 | 431632315236611 |
oct | 54060653257275 |
9 | 11650448402235 |
10 | 3030211452605 |
11 | a69118405227 |
12 | 40b337826765 |
13 | 18c99495c08c |
14 | a693d465341 |
15 | 53c51bda605 |
hex | 2c186ad5ebd |
3030211452605 has 32 divisors (see below), whose sum is σ = 3970625702400. Its totient is φ = 2212205299200.
The previous prime is 3030211452601. The next prime is 3030211452637. The reversal of 3030211452605 is 5062541120303.
It is a happy number.
It is not a de Polignac number, because 3030211452605 - 22 = 3030211452601 is a prime.
It is a super-2 number, since 2×30302114526052 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3030211452601) 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 31 ways as a sum of consecutive naturals, for example, 4616186 + ... + 5231595.
It is an arithmetic number, because the mean of its divisors is an integer number (124082053200).
Almost surely, 23030211452605 is an apocalyptic number.
It is an amenable number.
3030211452605 is a deficient number, since it is larger than the sum of its proper divisors (940414249795).
3030211452605 is a wasteful number, since it uses less digits than its factorization.
3030211452605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9847925.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 3030211452605 its reverse (5062541120303), we get a palindrome (8092752572908).
The spelling of 3030211452605 in words is "three trillion, thirty billion, two hundred eleven million, four hundred fifty-two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •