Base | Representation |
---|---|
bin | 1101101100000101010110… |
… | …00101000001110001101101 |
3 | 10221120201112012122002000021 |
4 | 12312002223011001301231 |
5 | 12421142344231013201 |
6 | 144004400211202141 |
7 | 6224540435016142 |
oct | 666025305016155 |
9 | 127521465562007 |
10 | 30102001032301 |
11 | 9656206909360 |
12 | 3461b772a6351 |
13 | 13a47b6697b73 |
14 | 760d320943c9 |
15 | 37304ea2bea1 |
hex | 1b60ab141c6d |
30102001032301 has 8 divisors (see below), whose sum is σ = 32983209784224. Its totient is φ = 27244902814320.
The previous prime is 30102001032283. The next prime is 30102001032307. The reversal of 30102001032301 is 10323010020103.
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 30102001032301 - 217 = 30102000901229 is a prime.
It is a super-2 number, since 2×301020010323012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30102001032307) 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, 6027630870 + ... + 6027635863.
It is an arithmetic number, because the mean of its divisors is an integer number (4122901223028).
Almost surely, 230102001032301 is an apocalyptic number.
It is an amenable number.
30102001032301 is a deficient number, since it is larger than the sum of its proper divisors (2881208751923).
30102001032301 is a wasteful number, since it uses less digits than its factorization.
30102001032301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12055266971.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 30102001032301 its reverse (10323010020103), we get a palindrome (40425011052404).
The spelling of 30102001032301 in words is "thirty trillion, one hundred two billion, one million, thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •