Base | Representation |
---|---|
bin | 11100110111101111… |
… | …101100100011011011 |
3 | 2222000110000020120202 |
4 | 130313233230203123 |
5 | 1001442001134321 |
6 | 22124034012415 |
7 | 2145131555405 |
oct | 346757544333 |
9 | 88013006522 |
10 | 31000021211 |
11 | 12168781845 |
12 | 6011a1710b |
13 | 2c0060bb23 |
14 | 170119db75 |
15 | c1681170b |
hex | 737bec8db |
31000021211 has 8 divisors (see below), whose sum is σ = 31043341824. Its totient is φ = 30956725800.
The previous prime is 31000021187. The next prime is 31000021229. The reversal of 31000021211 is 11212000013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31000021211 is a prime.
It is a super-2 number, since 2×310000212112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31000021192 and 31000021201.
It is not an unprimeable number, because it can be changed into a prime (31000021291) 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 7 ways as a sum of consecutive naturals, for example, 4331486 + ... + 4338636.
It is an arithmetic number, because the mean of its divisors is an integer number (3880417728).
Almost surely, 231000021211 is an apocalyptic number.
31000021211 is a deficient number, since it is larger than the sum of its proper divisors (43320613).
31000021211 is an equidigital number, since it uses as much as digits as its factorization.
31000021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12601.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 31000021211 its reverse (11212000013), we get a palindrome (42212021224).
The spelling of 31000021211 in words is "thirty-one billion, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •