Base | Representation |
---|---|
bin | 10011000100010110011… |
… | …111111101011011010100 |
3 | 11122021020000120222220111 |
4 | 103010112133331123110 |
5 | 132432040140031400 |
6 | 2441544003212404 |
7 | 163445336331622 |
oct | 23042637753324 |
9 | 4567200528814 |
10 | 1310342502100 |
11 | 465793200095 |
12 | 191b53077104 |
13 | 96745a44078 |
14 | 475c6dc6512 |
15 | 24141dda3ba |
hex | 131167fd6d4 |
1310342502100 has 18 divisors (see below), whose sum is σ = 2843443229774. Its totient is φ = 524137000800.
The previous prime is 1310342502089. The next prime is 1310342502167. The reversal of 1310342502100 is 12052430131.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 76390326544 + 1233952175556 = 276388^2 + 1110834^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6551712411 + ... + 6551712610.
Almost surely, 21310342502100 is an apocalyptic number.
1310342502100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1310342502100 is an abundant number, since it is smaller than the sum of its proper divisors (1533100727674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310342502100 is a wasteful number, since it uses less digits than its factorization.
1310342502100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13103425035 (or 13103425028 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 1310342502100 its reverse (12052430131), we get a palindrome (1322394932231).
The spelling of 1310342502100 in words is "one trillion, three hundred ten billion, three hundred forty-two million, five hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •