Base | Representation |
---|---|
bin | 1101101100000010000011… |
… | …01001110110111000101001 |
3 | 10221120112221221110021100002 |
4 | 12312001001221312320221 |
5 | 12421130233432131441 |
6 | 144003504505152345 |
7 | 6224445550036322 |
oct | 666010151667051 |
9 | 127515857407302 |
10 | 30100232302121 |
11 | 9655489472183 |
12 | 3461762a8b6b5 |
13 | 13a4594105a67 |
14 | 760c051db449 |
15 | 372e995edb9b |
hex | 1b6041a76e29 |
30100232302121 has 8 divisors (see below), whose sum is σ = 30390289979904. Its totient is φ = 29811194160160.
The previous prime is 30100232302099. The next prime is 30100232302123. The reversal of 30100232302121 is 12120323200103.
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 30100232302121 - 242 = 25702185791017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30100232302093 and 30100232302102.
It is not an unprimeable number, because it can be changed into a prime (30100232302123) 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, 254824625 + ... + 254942718.
It is an arithmetic number, because the mean of its divisors is an integer number (3798786247488).
Almost surely, 230100232302121 is an apocalyptic number.
It is an amenable number.
30100232302121 is a deficient number, since it is larger than the sum of its proper divisors (290057677783).
30100232302121 is a wasteful number, since it uses less digits than its factorization.
30100232302121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509767911.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 30100232302121 its reverse (12120323200103), we get a palindrome (42220555502224).
The spelling of 30100232302121 in words is "thirty trillion, one hundred billion, two hundred thirty-two million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •