Base | Representation |
---|---|
bin | 10011000100011111111… |
… | …001100100101001100101 |
3 | 11122021122000100110021000 |
4 | 103010133321210221211 |
5 | 132432401023230201 |
6 | 2442011355343513 |
7 | 163452263000331 |
oct | 23043771445145 |
9 | 4567560313230 |
10 | 1310500211301 |
11 | 465864228376 |
12 | 191b97a51b99 |
13 | 9676c611c18 |
14 | 475ddd1a7c1 |
15 | 24150b8dd86 |
hex | 1311fe64a65 |
1310500211301 has 32 divisors (see below), whose sum is σ = 1955886894720. Its totient is φ = 867186041472.
The previous prime is 1310500211287. The next prime is 1310500211303. The reversal of 1310500211301 is 1031120050131.
1310500211301 is a `hidden beast` number, since 1 + 3 + 10 + 500 + 21 + 130 + 1 = 666.
It is not a de Polignac number, because 1310500211301 - 213 = 1310500203109 is a prime.
It is a super-2 number, since 2×13105002113012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310500211303) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42460191 + ... + 42491043.
It is an arithmetic number, because the mean of its divisors is an integer number (61121465460).
Almost surely, 21310500211301 is an apocalyptic number.
It is an amenable number.
1310500211301 is a deficient number, since it is larger than the sum of its proper divisors (645386683419).
1310500211301 is a wasteful number, since it uses less digits than its factorization.
1310500211301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42482 (or 42476 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
Adding to 1310500211301 its reverse (1031120050131), we get a palindrome (2341620261432).
The spelling of 1310500211301 in words is "one trillion, three hundred ten billion, five hundred million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •