Base | Representation |
---|---|
bin | 10011000100000010001… |
… | …001010110101110110000 |
3 | 11122020100020001112010220 |
4 | 103010002021112232300 |
5 | 132430340231011422 |
6 | 2441450044253040 |
7 | 163434022022403 |
oct | 23040211265660 |
9 | 4566306045126 |
10 | 1310001032112 |
11 | 465628481693 |
12 | 191a78841180 |
13 | 966c0086616 |
14 | 475938d9d3a |
15 | 24121e38e5c |
hex | 13102256bb0 |
1310001032112 has 40 divisors (see below), whose sum is σ = 3385168327920. Its totient is φ = 436538108160.
The previous prime is 1310001032101. The next prime is 1310001032143. The reversal of 1310001032112 is 2112301000131.
It is a happy number.
It is a super-2 number, since 2×13100010321122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1310001032091 and 1310001032100.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3863839 + ... + 4189182.
It is an arithmetic number, because the mean of its divisors is an integer number (84629208198).
Almost surely, 21310001032112 is an apocalyptic number.
1310001032112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1310001032112 is an abundant number, since it is smaller than the sum of its proper divisors (2075167295808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310001032112 is a wasteful number, since it uses less digits than its factorization.
1310001032112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8056421 (or 8056415 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1310001032112 its reverse (2112301000131), we get a palindrome (3422302032243).
The spelling of 1310001032112 in words is "one trillion, three hundred ten billion, one million, thirty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •