Base | Representation |
---|---|
bin | 1101101100101010110101… |
… | …11110101001110001100011 |
3 | 10221122122111011122020001020 |
4 | 12312111122332221301203 |
5 | 12422010111244122243 |
6 | 144021525540140523 |
7 | 6226152340420260 |
oct | 666253276516143 |
9 | 127578434566036 |
10 | 30122132020323 |
11 | 96637a7274642 |
12 | 3465a55097743 |
13 | 13a6674245bb5 |
14 | 761cc1916267 |
15 | 37382c01e283 |
hex | 1b655afa9c63 |
30122132020323 has 32 divisors (see below), whose sum is σ = 46783950354432. Its totient is φ = 16881555600000.
The previous prime is 30122132020319. The next prime is 30122132020327. The reversal of 30122132020323 is 32302023122103.
It is an interprime number because it is at equal distance from previous prime (30122132020319) and next prime (30122132020327).
It is not a de Polignac number, because 30122132020323 - 22 = 30122132020319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30122132020293 and 30122132020302.
It is not an unprimeable number, because it can be changed into a prime (30122132020327) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2093428 + ... + 8039073.
It is an arithmetic number, because the mean of its divisors is an integer number (1461998448576).
Almost surely, 230122132020323 is an apocalyptic number.
30122132020323 is a deficient number, since it is larger than the sum of its proper divisors (16661818334109).
30122132020323 is a wasteful number, since it uses less digits than its factorization.
30122132020323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10135235.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 30122132020323 its reverse (32302023122103), we get a palindrome (62424155142426).
The spelling of 30122132020323 in words is "thirty trillion, one hundred twenty-two billion, one hundred thirty-two million, twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •