Base | Representation |
---|---|
bin | 1101101111110110001101… |
… | …00011111010000111110010 |
3 | 10222001002022001101201010120 |
4 | 12313323012203322013302 |
5 | 12430302211122143442 |
6 | 144144023403311110 |
7 | 6240066033512613 |
oct | 667730643720762 |
9 | 128032261351116 |
10 | 30231311131122 |
11 | 96a6033006522 |
12 | 3483044b1b496 |
13 | 13b3a53657b3a |
14 | 7672bba93c0a |
15 | 3765bc0154ec |
hex | 1b7ec68fa1f2 |
30231311131122 has 64 divisors (see below), whose sum is σ = 60928956950400. Its totient is φ = 9999522031104.
The previous prime is 30231311131121. The next prime is 30231311131123. The reversal of 30231311131122 is 22113111313203.
It is an interprime number because it is at equal distance from previous prime (30231311131121) and next prime (30231311131123).
It is a junction number, because it is equal to n+sod(n) for n = 30231311131092 and 30231311131101.
It is not an unprimeable number, because it can be changed into a prime (30231311131121) 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, 5440218768 + ... + 5440224324.
It is an arithmetic number, because the mean of its divisors is an integer number (952014952350).
Almost surely, 230231311131122 is an apocalyptic number.
30231311131122 is an abundant number, since it is smaller than the sum of its proper divisors (30697645819278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30231311131122 is a wasteful number, since it uses less digits than its factorization.
30231311131122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10667.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 30231311131122 its reverse (22113111313203), we get a palindrome (52344422444325).
The spelling of 30231311131122 in words is "thirty trillion, two hundred thirty-one billion, three hundred eleven million, one hundred thirty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •