Base | Representation |
---|---|
bin | 1011110110100001000010… |
… | …1101101111001100100000 |
3 | 1201010202211111212211111110 |
4 | 2331220100231233030200 |
5 | 3202000410031420222 |
6 | 43414242240543320 |
7 | 2513321363420403 |
oct | 275502055571440 |
9 | 51122744784443 |
10 | 13031211201312 |
11 | 4174562000247 |
12 | 1565652321b40 |
13 | 736ab7c67285 |
14 | 3309dd277d3a |
15 | 178e897b030c |
hex | bda10b6f320 |
13031211201312 has 48 divisors (see below), whose sum is σ = 34316216796960. Its totient is φ = 4329859302912.
The previous prime is 13031211201233. The next prime is 13031211201319. The reversal of 13031211201312 is 21310211213031.
It is a tau number, because it is divible by the number of its divisors (48).
It is not an unprimeable number, because it can be changed into a prime (13031211201319) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 216809862 + ... + 216869957.
It is an arithmetic number, because the mean of its divisors is an integer number (714921183270).
Almost surely, 213031211201312 is an apocalyptic number.
13031211201312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13031211201312 is an abundant number, since it is smaller than the sum of its proper divisors (21285005595648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13031211201312 is a wasteful number, since it uses less digits than its factorization.
13031211201312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433680145 (or 433680137 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13031211201312 its reverse (21310211213031), we get a palindrome (34341422414343).
The spelling of 13031211201312 in words is "thirteen trillion, thirty-one billion, two hundred eleven million, two hundred one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •