Base | Representation |
---|---|
bin | 1011111100010001110110… |
… | …0111110110100011011001 |
3 | 1201111020101001101000012222 |
4 | 2333010131213312203121 |
5 | 3210111133233311301 |
6 | 43531534111513425 |
7 | 2523424615414316 |
oct | 277043547664331 |
9 | 51436331330188 |
10 | 13130212010201 |
11 | 4202545415270 |
12 | 1580881528875 |
13 | 743234760a70 |
14 | 33571171bd0d |
15 | 17b830e2831b |
hex | bf11d9f68d9 |
13130212010201 has 64 divisors (see below), whose sum is σ = 15969352089600. Its totient is φ = 10636726464000.
The previous prime is 13130212010177. The next prime is 13130212010203. The reversal of 13130212010201 is 10201021203131.
It is not a de Polignac number, because 13130212010201 - 218 = 13130211748057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13130212010201.
It is not an unprimeable number, because it can be changed into a prime (13130212010203) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 551654501 + ... + 551678301.
It is an arithmetic number, because the mean of its divisors is an integer number (249521126400).
Almost surely, 213130212010201 is an apocalyptic number.
13130212010201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13130212010201 is a deficient number, since it is larger than the sum of its proper divisors (2839140079399).
13130212010201 is a wasteful number, since it uses less digits than its factorization.
13130212010201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24990.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 13130212010201 its reverse (10201021203131), we get a palindrome (23331233213332).
The spelling of 13130212010201 in words is "thirteen trillion, one hundred thirty billion, two hundred twelve million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •