Base | Representation |
---|---|
bin | 10011000101111111010… |
… | …100100110001111000000 |
3 | 11122102202120202121111121 |
4 | 103011333110212033000 |
5 | 132444140342144300 |
6 | 2442434304522024 |
7 | 163540042411306 |
oct | 23057724461700 |
9 | 4572676677447 |
10 | 1312101131200 |
11 | 466505978172 |
12 | 192364020314 |
13 | 969661aa5c2 |
14 | 477127b0276 |
15 | 241e64c081a |
hex | 1317f5263c0 |
1312101131200 has 42 divisors (see below), whose sum is σ = 3228588849896. Its totient is φ = 524840451840.
The previous prime is 1312101131183. The next prime is 1312101131203. The reversal of 1312101131200 is 21311012131.
It is a happy number.
It is a super-2 number, since 2×13121011312002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312101131203) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 410030004 + ... + 410033203.
Almost surely, 21312101131200 is an apocalyptic number.
1312101131200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1312101131200 is an abundant number, since it is smaller than the sum of its proper divisors (1916487718696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312101131200 is an equidigital number, since it uses as much as digits as its factorization.
1312101131200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 820063229 (or 820063214 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1312101131200 its reverse (21311012131), we get a palindrome (1333412143331).
The spelling of 1312101131200 in words is "one trillion, three hundred twelve billion, one hundred one million, one hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •