Base | Representation |
---|---|
bin | 1101101100000101111011… |
… | …00011011111111110110111 |
3 | 10221120202022210220120210100 |
4 | 12312002331203133332313 |
5 | 12421144013104311411 |
6 | 144004451043125143 |
7 | 6224551220543655 |
oct | 666027543377667 |
9 | 127522283816710 |
10 | 30102311010231 |
11 | 9656355888369 |
12 | 34620430737b3 |
13 | 13a483597a465 |
14 | 760d61303dd5 |
15 | 37306bd5c456 |
hex | 1b60bd8dffb7 |
30102311010231 has 24 divisors (see below), whose sum is σ = 43752769038576. Its totient is φ = 19942936755840.
The previous prime is 30102311010223. The next prime is 30102311010271. The reversal of 30102311010231 is 13201011320103.
30102311010231 is a `hidden beast` number, since 301 + 0 + 2 + 31 + 101 + 0 + 231 = 666.
It is not a de Polignac number, because 30102311010231 - 23 = 30102311010223 is a prime.
It is a super-2 number, since 2×301023110102312 (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 (30102311010221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1137685 + ... + 7842126.
It is an arithmetic number, because the mean of its divisors is an integer number (1823032043274).
Almost surely, 230102311010231 is an apocalyptic number.
30102311010231 is a deficient number, since it is larger than the sum of its proper divisors (13650458028345).
30102311010231 is a wasteful number, since it uses less digits than its factorization.
30102311010231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8982143 (or 8982140 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 30102311010231 its reverse (13201011320103), we get a palindrome (43303322330334).
The spelling of 30102311010231 in words is "thirty trillion, one hundred two billion, three hundred eleven million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •