Base | Representation |
---|---|
bin | 1101101100111011110001… |
… | …10010001110000011000111 |
3 | 10221200111221200001122120110 |
4 | 12312131320302032003013 |
5 | 12422132220313341403 |
6 | 144030031534204103 |
7 | 6226623525161112 |
oct | 666357062160307 |
9 | 127614850048513 |
10 | 30131222012103 |
11 | 9667641340a43 |
12 | 3467771353633 |
13 | 13a7492544464 |
14 | 762504c75579 |
15 | 373bb0075103 |
hex | 1b6778c8e0c7 |
30131222012103 has 8 divisors (see below), whose sum is σ = 41921700190848. Its totient is φ = 19214112587384.
The previous prime is 30131222012083. The next prime is 30131222012117. The reversal of 30131222012103 is 30121022213103.
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 30131222012103 - 29 = 30131222011591 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30131222012103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30131222002103) 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, 218342188425 + ... + 218342188562.
It is an arithmetic number, because the mean of its divisors is an integer number (5240212523856).
Almost surely, 230131222012103 is an apocalyptic number.
30131222012103 is a deficient number, since it is larger than the sum of its proper divisors (11790478178745).
30131222012103 is a wasteful number, since it uses less digits than its factorization.
30131222012103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 436684377013.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 30131222012103 its reverse (30121022213103), we get a palindrome (60252244225206).
The spelling of 30131222012103 in words is "thirty trillion, one hundred thirty-one billion, two hundred twenty-two million, twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •