Base | Representation |
---|---|
bin | 10011001110010010011… |
… | …010010011111111010111 |
3 | 11200021202112212122211202 |
4 | 103032102122103333113 |
5 | 133120412400043111 |
6 | 2450510401223115 |
7 | 164303615021300 |
oct | 23162232237727 |
9 | 4607675778752 |
10 | 1321011331031 |
11 | 46a268504187 |
12 | 194030031a9b |
13 | 977561788b2 |
14 | 47d19ccb7a7 |
15 | 2456885eb3b |
hex | 13392693fd7 |
1321011331031 has 12 divisors (see below), whose sum is σ = 1537150674672. Its totient is φ = 1131953514048.
The previous prime is 1321011330937. The next prime is 1321011331051. The reversal of 1321011331031 is 1301331101231.
It is not a de Polignac number, because 1321011331031 - 210 = 1321011330007 is a prime.
It is a super-2 number, since 2×13210113310312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1321011330994 and 1321011331012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1321011331051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3906395 + ... + 4231068.
It is an arithmetic number, because the mean of its divisors is an integer number (128095889556).
Almost surely, 21321011331031 is an apocalyptic number.
1321011331031 is a deficient number, since it is larger than the sum of its proper divisors (216139343641).
1321011331031 is an equidigital number, since it uses as much as digits as its factorization.
1321011331031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8140790 (or 8140783 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1321011331031 its reverse (1301331101231), we get a palindrome (2622342432262).
The spelling of 1321011331031 in words is "one trillion, three hundred twenty-one billion, eleven million, three hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •