Base | Representation |
---|---|
bin | 1110000111011001000110… |
… | …10000100111000011100110 |
3 | 11001220102111021200211012012 |
4 | 13003230203100213003212 |
5 | 13032031033433030110 |
6 | 150003420511354222 |
7 | 6352406033260343 |
oct | 703544320470346 |
9 | 131812437624165 |
10 | 31040320205030 |
11 | 9988142599844 |
12 | 35939a4522972 |
13 | 1442121c10976 |
14 | 7945067137ca |
15 | 38c66b1c7905 |
hex | 1c3b234270e6 |
31040320205030 has 8 divisors (see below), whose sum is σ = 55872576369072. Its totient is φ = 12416128082008.
The previous prime is 31040320205003. The next prime is 31040320205057. The reversal of 31040320205030 is 3050202304013.
It is an interprime number because it is at equal distance from previous prime (31040320205003) and next prime (31040320205057).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×310403202050302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31040320204987 and 31040320205005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1552016010242 + ... + 1552016010261.
It is an arithmetic number, because the mean of its divisors is an integer number (6984072046134).
Almost surely, 231040320205030 is an apocalyptic number.
31040320205030 is a deficient number, since it is larger than the sum of its proper divisors (24832256164042).
31040320205030 is a wasteful number, since it uses less digits than its factorization.
31040320205030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3104032020510.
The product of its (nonzero) digits is 2160, while the sum is 23.
Adding to 31040320205030 its reverse (3050202304013), we get a palindrome (34090522509043).
The spelling of 31040320205030 in words is "thirty-one trillion, forty billion, three hundred twenty million, two hundred five thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •