Base | Representation |
---|---|
bin | 10011000101111111011… |
… | …100001001010111010100 |
3 | 11122102202201111011001012 |
4 | 103011333130021113110 |
5 | 132444141344010400 |
6 | 2442434415151352 |
7 | 163540065262556 |
oct | 23057734112724 |
9 | 4572681434035 |
10 | 1312103110100 |
11 | 466506aa9a22 |
12 | 192364815558 |
13 | 96966721253 |
14 | 47712b674d6 |
15 | 241e6761d35 |
hex | 1317f7095d4 |
1312103110100 has 36 divisors (see below), whose sum is σ = 2850601875324. Its totient is φ = 524225921280.
The previous prime is 1312103110091. The next prime is 1312103110159. The reversal of 1312103110100 is 10113012131.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 24046084624 + 1288057025476 = 155068^2 + 1134926^2 .
It is a super-2 number, since 2×13121031101002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7605809 + ... + 7776408.
Almost surely, 21312103110100 is an apocalyptic number.
1312103110100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1312103110100 is an abundant number, since it is smaller than the sum of its proper divisors (1538498765224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312103110100 is a wasteful number, since it uses less digits than its factorization.
1312103110100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15383084 (or 15383077 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1312103110100 its reverse (10113012131), we get a palindrome (1322216122231).
The spelling of 1312103110100 in words is "one trillion, three hundred twelve billion, one hundred three million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •