Base | Representation |
---|---|
bin | 1110000110110011101000… |
… | …00001000000000110011001 |
3 | 11001211111120002102020221202 |
4 | 13003121310001000012121 |
5 | 13031213332224400241 |
6 | 145550252214443545 |
7 | 6351064323312020 |
oct | 703316401000631 |
9 | 131744502366852 |
10 | 31020200231321 |
11 | 997a6583767a4 |
12 | 358bb0a3635b5 |
13 | 144026671b092 |
14 | 79355851b8b7 |
15 | 38bd8eb5dd9b |
hex | 1c3674040199 |
31020200231321 has 16 divisors (see below), whose sum is σ = 35710797265920. Its totient is φ = 26394432005520.
The previous prime is 31020200231299. The next prime is 31020200231351. The reversal of 31020200231321 is 12313200202013.
It is a cyclic number.
It is not a de Polignac number, because 31020200231321 - 214 = 31020200214937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31020200231293 and 31020200231302.
It is not an unprimeable number, because it can be changed into a prime (31020200231351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6688436 + ... + 10333226.
It is an arithmetic number, because the mean of its divisors is an integer number (2231924829120).
Almost surely, 231020200231321 is an apocalyptic number.
It is an amenable number.
31020200231321 is a deficient number, since it is larger than the sum of its proper divisors (4690597034599).
31020200231321 is a wasteful number, since it uses less digits than its factorization.
31020200231321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3653684.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 31020200231321 its reverse (12313200202013), we get a palindrome (43333400433334).
The spelling of 31020200231321 in words is "thirty-one trillion, twenty billion, two hundred million, two hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.558 sec. • engine limits •