Base | Representation |
---|---|
bin | 11100110111110001… |
… | …001001001000100101 |
3 | 2222000110201111202120 |
4 | 130313301021020211 |
5 | 1001442100303141 |
6 | 22124050100153 |
7 | 2145135025104 |
oct | 346761111045 |
9 | 88013644676 |
10 | 31000400421 |
11 | 12168a10741 |
12 | 6011b7a659 |
13 | 2c00712603 |
14 | 170125c03b |
15 | c16888c66 |
hex | 737c49225 |
31000400421 has 8 divisors (see below), whose sum is σ = 41468506464. Its totient is φ = 20599614000.
The previous prime is 31000400363. The next prime is 31000400423. The reversal of 31000400421 is 12400400013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31000400421 - 215 = 31000367653 is a prime.
It is a super-2 number, since 2×310004004212 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31000400421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31000400423) 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 7 ways as a sum of consecutive naturals, for example, 16828830 + ... + 16830671.
It is an arithmetic number, because the mean of its divisors is an integer number (5183563308).
Almost surely, 231000400421 is an apocalyptic number.
It is an amenable number.
31000400421 is a deficient number, since it is larger than the sum of its proper divisors (10468106043).
31000400421 is a wasteful number, since it uses less digits than its factorization.
31000400421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33659811.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 31000400421 its reverse (12400400013), we get a palindrome (43400800434).
The spelling of 31000400421 in words is "thirty-one billion, four hundred thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •