Base | Representation |
---|---|
bin | 1101101100000001110100… |
… | …11111101111110001001111 |
3 | 10221120112122120111000022122 |
4 | 12312000322133233301033 |
5 | 12421130012211223043 |
6 | 144003444535203155 |
7 | 6224442561215441 |
oct | 666007237576117 |
9 | 127515576430278 |
10 | 30100112211023 |
11 | 96554276a8a38 |
12 | 346172a8164bb |
13 | 13a457527953a |
14 | 760bd329a491 |
15 | 372e8dccb368 |
hex | 1b603a7efc4f |
30100112211023 has 8 divisors (see below), whose sum is σ = 30668437845936. Its totient is φ = 29531801353600.
The previous prime is 30100112211019. The next prime is 30100112211049. The reversal of 30100112211023 is 32011221100103.
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 30100112211023 - 22 = 30100112211019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30100112210992 and 30100112211010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30100112211073) 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, 461588 + ... + 7772598.
It is an arithmetic number, because the mean of its divisors is an integer number (3833554730742).
Almost surely, 230100112211023 is an apocalyptic number.
30100112211023 is a deficient number, since it is larger than the sum of its proper divisors (568325634913).
30100112211023 is an equidigital number, since it uses as much as digits as its factorization.
30100112211023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7388745.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 30100112211023 its reverse (32011221100103), we get a palindrome (62111333311126).
The spelling of 30100112211023 in words is "thirty trillion, one hundred billion, one hundred twelve million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •