Base | Representation |
---|---|
bin | 11101010001101101… |
… | …101011101111011101 |
3 | 10000010210211002012010 |
4 | 131101231223233131 |
5 | 1003340014414323 |
6 | 22235200101433 |
7 | 2162002023450 |
oct | 352155535735 |
9 | 100123732163 |
10 | 31435701213 |
11 | 123716a7664 |
12 | 6113904879 |
13 | 2c6c963847 |
14 | 1742db1497 |
15 | c3ebc1c93 |
hex | 751b6bbdd |
31435701213 has 32 divisors (see below), whose sum is σ = 49582229760. Its totient is φ = 17333890560.
The previous prime is 31435701211. The next prime is 31435701223. The reversal of 31435701213 is 31210753413.
It is not a de Polignac number, because 31435701213 - 21 = 31435701211 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31435701211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1119481 + ... + 1147217.
It is an arithmetic number, because the mean of its divisors is an integer number (1549444680).
Almost surely, 231435701213 is an apocalyptic number.
It is an amenable number.
31435701213 is a deficient number, since it is larger than the sum of its proper divisors (18146528547).
31435701213 is a wasteful number, since it uses less digits than its factorization.
31435701213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29637.
The product of its (nonzero) digits is 7560, while the sum is 30.
The spelling of 31435701213 in words is "thirty-one billion, four hundred thirty-five million, seven hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •