Base | Representation |
---|---|
bin | 1101101111110101110110… |
… | …01011010011011110111111 |
3 | 10222001001210201222221122011 |
4 | 12313322323023103132333 |
5 | 12430301313223211111 |
6 | 144143552421432051 |
7 | 6240061224164140 |
oct | 667727313233677 |
9 | 128031721887564 |
10 | 30231120132031 |
11 | 96a5a45211035 |
12 | 3482bb0b6b627 |
13 | 13b3a22c02720 |
14 | 7672a0575ac7 |
15 | 3765aa388021 |
hex | 1b7ebb2d37bf |
30231120132031 has 32 divisors (see below), whose sum is σ = 37306203217920. Its totient is φ = 23855706838656.
The previous prime is 30231120132011. The next prime is 30231120132047. The reversal of 30231120132031 is 13023102113203.
It is a de Polignac number, because none of the positive numbers 2k-30231120132031 is a prime.
It is a super-2 number, since 2×302311201320312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30231120131993 and 30231120132011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30231120132011) 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, 569437170 + ... + 569490256.
It is an arithmetic number, because the mean of its divisors is an integer number (1165818850560).
Almost surely, 230231120132031 is an apocalyptic number.
30231120132031 is a deficient number, since it is larger than the sum of its proper divisors (7075083085889).
30231120132031 is a wasteful number, since it uses less digits than its factorization.
30231120132031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69583.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30231120132031 its reverse (13023102113203), we get a palindrome (43254222245234).
The spelling of 30231120132031 in words is "thirty trillion, two hundred thirty-one billion, one hundred twenty million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •