Base | Representation |
---|---|
bin | 10011000100001110000… |
… | …000011110101111010101 |
3 | 11122020212002111202222000 |
4 | 103010032000132233111 |
5 | 132431242202012323 |
6 | 2441521513425513 |
7 | 163441656343542 |
oct | 23041600365725 |
9 | 4566762452860 |
10 | 1310200032213 |
11 | 46571a841386 |
12 | 191b1340b299 |
13 | 96722380767 |
14 | 475b20dbbc9 |
15 | 24134646e43 |
hex | 1310e01ebd5 |
1310200032213 has 32 divisors (see below), whose sum is σ = 2019841612800. Its totient is φ = 838693236528.
The previous prime is 1310200032199. The next prime is 1310200032221. The reversal of 1310200032213 is 3122300020131.
1310200032213 is a `hidden beast` number, since 1 + 310 + 20 + 0 + 0 + 322 + 13 = 666.
It is not a de Polignac number, because 1310200032213 - 212 = 1310200028117 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310200032223) 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 31 ways as a sum of consecutive naturals, for example, 9495145 + ... + 9632142.
It is an arithmetic number, because the mean of its divisors is an integer number (63120050400).
Almost surely, 21310200032213 is an apocalyptic number.
It is an amenable number.
1310200032213 is a deficient number, since it is larger than the sum of its proper divisors (709641580587).
1310200032213 is a wasteful number, since it uses less digits than its factorization.
1310200032213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19127398 (or 19127392 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1310200032213 its reverse (3122300020131), we get a palindrome (4432500052344).
The spelling of 1310200032213 in words is "one trillion, three hundred ten billion, two hundred million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •