Base | Representation |
---|---|
bin | 1110100111000110110010… |
… | …10000010010101111011111 |
3 | 11012202121010222001011000000 |
4 | 13103203121100102233133 |
5 | 13202404220034113043 |
6 | 152200152433505343 |
7 | 6524213234254242 |
oct | 723433120225737 |
9 | 135677128034000 |
10 | 32130000301023 |
11 | a2682905a7149 |
12 | 372b014112253 |
13 | 14c0acc952161 |
14 | 7d1159383259 |
15 | 3aab95b792d3 |
hex | 1d38d9412bdf |
32130000301023 has 28 divisors (see below), whose sum is σ = 48189946764168. Its totient is φ = 21412448593200.
The previous prime is 32130000301001. The next prime is 32130000301031. The reversal of 32130000301023 is 32010300003123.
32130000301023 is a `hidden beast` number, since 321 + 300 + 0 + 0 + 30 + 10 + 2 + 3 = 666.
It is not a de Polignac number, because 32130000301023 - 29 = 32130000300511 is a prime.
It is a super-2 number, since 2×321300003010232 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32130000300987 and 32130000301005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32130000301093) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 5699553 + ... + 9835898.
Almost surely, 232130000301023 is an apocalyptic number.
32130000301023 is a deficient number, since it is larger than the sum of its proper divisors (16059946463145).
32130000301023 is an equidigital number, since it uses as much as digits as its factorization.
32130000301023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15538306 (or 15538291 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 32130000301023 its reverse (32010300003123), we get a palindrome (64140300304146).
The spelling of 32130000301023 in words is "thirty-two trillion, one hundred thirty billion, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •