Base | Representation |
---|---|
bin | 1101110101101100000010… |
… | …10010001001011100011101 |
3 | 10222202021100021001222122012 |
4 | 12322312001102021130131 |
5 | 12442044230122412201 |
6 | 144420135022201005 |
7 | 6260432430422030 |
oct | 672660122113435 |
9 | 128667307058565 |
10 | 30432012310301 |
11 | 9773164651a48 |
12 | 34b5b17423165 |
13 | 13c995a00a024 |
14 | 772cbad39017 |
15 | 37b916ce15bb |
hex | 1bad8148971d |
30432012310301 has 8 divisors (see below), whose sum is σ = 35098520096640. Its totient is φ = 25845273888048.
The previous prime is 30432012310267. The next prime is 30432012310307. The reversal of 30432012310301 is 10301321023403.
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 30432012310301 - 26 = 30432012310237 is a prime.
It is a super-2 number, since 2×304320123103012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30432012310307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19942340201 + ... + 19942341726.
It is an arithmetic number, because the mean of its divisors is an integer number (4387315012080).
Almost surely, 230432012310301 is an apocalyptic number.
It is an amenable number.
30432012310301 is a deficient number, since it is larger than the sum of its proper divisors (4666507786339).
30432012310301 is a wasteful number, since it uses less digits than its factorization.
30432012310301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39884682043.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 30432012310301 its reverse (10301321023403), we get a palindrome (40733333333704).
The spelling of 30432012310301 in words is "thirty trillion, four hundred thirty-two billion, twelve million, three hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •