Base | Representation |
---|---|
bin | 1101111000010100011011… |
… | …00001111111010111011011 |
3 | 11000001220200101020021102101 |
4 | 12330022031201333113123 |
5 | 13000034344444300011 |
6 | 144525445203344231 |
7 | 6300112553115244 |
oct | 674121541772733 |
9 | 130056611207371 |
10 | 30522412103131 |
11 | 97a8533a07333 |
12 | 350b546082077 |
13 | 14053358ca4c0 |
14 | 777414d85ccb |
15 | 37de582e02c1 |
hex | 1bc28d87f5db |
30522412103131 has 32 divisors (see below), whose sum is σ = 33634099856448. Its totient is φ = 27527976230400.
The previous prime is 30522412103077. The next prime is 30522412103153. The reversal of 30522412103131 is 13130121422503.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30522412103131 is a prime.
It is a super-2 number, since 2×305224121031312 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30522412103131.
It is not an unprimeable number, because it can be changed into a prime (30522412103431) 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, 95414905 + ... + 95734261.
It is an arithmetic number, because the mean of its divisors is an integer number (1051065620514).
Almost surely, 230522412103131 is an apocalyptic number.
30522412103131 is a deficient number, since it is larger than the sum of its proper divisors (3111687753317).
30522412103131 is a wasteful number, since it uses less digits than its factorization.
30522412103131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320431.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 30522412103131 its reverse (13130121422503), we get a palindrome (43652533525634).
The spelling of 30522412103131 in words is "thirty trillion, five hundred twenty-two billion, four hundred twelve million, one hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •