Base | Representation |
---|---|
bin | 1011111100010101100100… |
… | …0110111010111001100011 |
3 | 1201111022221121021122212022 |
4 | 2333011121012322321203 |
5 | 3210120204230311321 |
6 | 43532221122252055 |
7 | 2523461424315326 |
oct | 277053106727143 |
9 | 51438847248768 |
10 | 13131210010211 |
11 | 4202a077a2467 |
12 | 1580abb7b702b |
13 | 74336344a807 |
14 | 3357a80a87bd |
15 | 17b88d861dab |
hex | bf1591bae63 |
13131210010211 has 8 divisors (see below), whose sum is σ = 13934371714560. Its totient is φ = 12347401600072.
The previous prime is 13131210010159. The next prime is 13131210010229. The reversal of 13131210010211 is 11201001213131.
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 13131210010211 - 214 = 13131209993827 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13131210010211.
It is not an unprimeable number, because it can be changed into a prime (13131210010231) 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, 4838322155 + ... + 4838324868.
It is an arithmetic number, because the mean of its divisors is an integer number (1741796464320).
Almost surely, 213131210010211 is an apocalyptic number.
13131210010211 is a deficient number, since it is larger than the sum of its proper divisors (803161704349).
13131210010211 is an equidigital number, since it uses as much as digits as its factorization.
13131210010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9676647105.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 13131210010211 its reverse (11201001213131), we get a palindrome (24332211223342).
The spelling of 13131210010211 in words is "thirteen trillion, one hundred thirty-one billion, two hundred ten million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •