Base | Representation |
---|---|
bin | 10011001110010010011… |
… | …100111111011001101011 |
3 | 11200021202121012022221110 |
4 | 103032102130333121223 |
5 | 133120413040030011 |
6 | 2450510424241403 |
7 | 164303624004240 |
oct | 23162234773153 |
9 | 4607677168843 |
10 | 1321012033131 |
11 | 46a26894372a |
12 | 194030310263 |
13 | 9775636333b |
14 | 47d1a0315c7 |
15 | 2456894cba6 |
hex | 1339273f66b |
1321012033131 has 32 divisors (see below), whose sum is σ = 2028522451968. Its totient is φ = 749045082240.
The previous prime is 1321012033127. The next prime is 1321012033153. The reversal of 1321012033131 is 1313302101231.
It is a happy number.
It is not a de Polignac number, because 1321012033131 - 22 = 1321012033127 is a prime.
It is a super-2 number, since 2×13210120331312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1321012033098 and 1321012033107.
It is not an unprimeable number, because it can be changed into a prime (1321012033181) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2180041 + ... + 2719301.
It is an arithmetic number, because the mean of its divisors is an integer number (63391326624).
Almost surely, 21321012033131 is an apocalyptic number.
1321012033131 is a deficient number, since it is larger than the sum of its proper divisors (707510418837).
1321012033131 is a wasteful number, since it uses less digits than its factorization.
1321012033131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 540171.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1321012033131 its reverse (1313302101231), we get a palindrome (2634314134362).
The spelling of 1321012033131 in words is "one trillion, three hundred twenty-one billion, twelve million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •