Base | Representation |
---|---|
bin | 11100110111110000… |
… | …110000111010100101 |
3 | 2222000110112110200111 |
4 | 130313300300322211 |
5 | 1001442034114341 |
6 | 22124044013021 |
7 | 2145134132641 |
oct | 346760607245 |
9 | 88013473614 |
10 | 31000301221 |
11 | 1216895315a |
12 | 6011b31171 |
13 | 2c006a9406 |
14 | 1701233c21 |
15 | c16869681 |
hex | 737c30ea5 |
31000301221 has 8 divisors (see below), whose sum is σ = 31467500480. Its totient is φ = 30533234688.
The previous prime is 31000301207. The next prime is 31000301239. The reversal of 31000301221 is 12210300013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31000301221 - 231 = 28852817573 is a prime.
It is a super-3 number, since 3×310003012213 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31000301281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 501925 + ... + 560293.
It is an arithmetic number, because the mean of its divisors is an integer number (3933437560).
Almost surely, 231000301221 is an apocalyptic number.
It is an amenable number.
31000301221 is a deficient number, since it is larger than the sum of its proper divisors (467199259).
31000301221 is an equidigital number, since it uses as much as digits as its factorization.
31000301221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66363.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 31000301221 its reverse (12210300013), we get a palindrome (43210601234).
The spelling of 31000301221 in words is "thirty-one billion, three hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •