Base | Representation |
---|---|
bin | 1101101111010000100101… |
… | …00010111010101000101111 |
3 | 10221222011011021110221220201 |
4 | 12313220102202322220233 |
5 | 12424434323420244043 |
6 | 144130443130454331 |
7 | 6235452332223454 |
oct | 667502242725057 |
9 | 127864137427821 |
10 | 30211111103023 |
11 | 9698507685424 |
12 | 347b147b943a7 |
13 | 13b1b846b61a6 |
14 | 766322dbd82b |
15 | 375cd8936c4d |
hex | 1b7a128baa2f |
30211111103023 has 8 divisors (see below), whose sum is σ = 30706769345840. Its totient is φ = 29715465574080.
The previous prime is 30211111103021. The next prime is 30211111103053. The reversal of 30211111103023 is 32030111111203.
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 30211111103023 - 21 = 30211111103021 is a prime.
It is a super-2 number, since 2×302111111030232 (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 (30211111103021) 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, 1673236 + ... + 7951222.
It is an arithmetic number, because the mean of its divisors is an integer number (3838346168230).
Almost surely, 230211111103023 is an apocalyptic number.
30211111103023 is a deficient number, since it is larger than the sum of its proper divisors (495658242817).
30211111103023 is an equidigital number, since it uses as much as digits as its factorization.
30211111103023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6356937.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 30211111103023 its reverse (32030111111203), we get a palindrome (62241222214226).
The spelling of 30211111103023 in words is "thirty trillion, two hundred eleven billion, one hundred eleven million, one hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •