Base | Representation |
---|---|
bin | 1011110110100001000010… |
… | …1110001000000001011110 |
3 | 1201010202211112001222222220 |
4 | 2331220100232020001132 |
5 | 3202000410043144011 |
6 | 43414242243050210 |
7 | 2513321364323031 |
oct | 275502056100136 |
9 | 51122745058886 |
10 | 13031211303006 |
11 | 417456206a696 |
12 | 1565652370966 |
13 | 736ab7ca1650 |
14 | 3309dd2a3018 |
15 | 178e897d0506 |
hex | bda10b8805e |
13031211303006 has 128 divisors (see below), whose sum is σ = 29677390364160. Its totient is φ = 3781494720000.
The previous prime is 13031211302959. The next prime is 13031211303029. The reversal of 13031211303006 is 60030311213031.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 826164136 + ... + 826179908.
It is an arithmetic number, because the mean of its divisors is an integer number (231854612220).
Almost surely, 213031211303006 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13031211303006, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14838695182080).
13031211303006 is an abundant number, since it is smaller than the sum of its proper divisors (16646179061154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13031211303006 is a wasteful number, since it uses less digits than its factorization.
13031211303006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18282.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 13031211303006 its reverse (60030311213031), we get a palindrome (73061522516037).
The spelling of 13031211303006 in words is "thirteen trillion, thirty-one billion, two hundred eleven million, three hundred three thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •