Base | Representation |
---|---|
bin | 10011000111000001100… |
… | …010101110101010100001 |
3 | 11122112122000022022002102 |
4 | 103013001202232222201 |
5 | 133003424301211001 |
6 | 2443140433300145 |
7 | 163606422642560 |
oct | 23070142565241 |
9 | 4575560268072 |
10 | 1313212132001 |
11 | 466a26016550 |
12 | 192614104655 |
13 | 96ab2410523 |
14 | 477ba173bd7 |
15 | 2425dccae6b |
hex | 131c18aeaa1 |
1313212132001 has 16 divisors (see below), whose sum is σ = 1637287536768. Its totient is φ = 1023259651200.
The previous prime is 1313212131937. The next prime is 1313212132031. The reversal of 1313212132001 is 1002312123131.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1313212132001 - 26 = 1313212131937 is a prime.
It is a super-2 number, since 2×13132121320012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1313212132031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3908981 + ... + 4231613.
It is an arithmetic number, because the mean of its divisors is an integer number (102330471048).
Almost surely, 21313212132001 is an apocalyptic number.
1313212132001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1313212132001 is a deficient number, since it is larger than the sum of its proper divisors (324075404767).
1313212132001 is a wasteful number, since it uses less digits than its factorization.
1313212132001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 375512.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1313212132001 its reverse (1002312123131), we get a palindrome (2315524255132).
The spelling of 1313212132001 in words is "one trillion, three hundred thirteen billion, two hundred twelve million, one hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •