Base | Representation |
---|---|
bin | 10011000101111111111… |
… | …110011111001001001001 |
3 | 11122102210100102111121100 |
4 | 103011333332133021021 |
5 | 132444201200042301 |
6 | 2442435340132013 |
7 | 163540234635012 |
oct | 23057776371111 |
9 | 4572710374540 |
10 | 1312112112201 |
11 | 466511098380 |
12 | 192367837009 |
13 | 96968553837 |
14 | 4771402c009 |
15 | 241e743e286 |
hex | 1317ff9f249 |
1312112112201 has 48 divisors (see below), whose sum is σ = 2126975355648. Its totient is φ = 772618502400.
The previous prime is 1312112112109. The next prime is 1312112112211. The reversal of 1312112112201 is 1022112112131.
It is a happy number.
It is not a de Polignac number, because 1312112112201 - 217 = 1312111981129 is a prime.
It is a super-2 number, since 2×13121121122012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1312112112211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 391710 + ... + 1666631.
It is an arithmetic number, because the mean of its divisors is an integer number (44311986576).
Almost surely, 21312112112201 is an apocalyptic number.
1312112112201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1312112112201 is a deficient number, since it is larger than the sum of its proper divisors (814863243447).
1312112112201 is a wasteful number, since it uses less digits than its factorization.
1312112112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2058542 (or 2058539 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1312112112201 its reverse (1022112112131), we get a palindrome (2334224224332).
The spelling of 1312112112201 in words is "one trillion, three hundred twelve billion, one hundred twelve million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •