Base | Representation |
---|---|
bin | 10011001101011101010… |
… | …110011101110101010001 |
3 | 11200012110111210210001002 |
4 | 103031131112131311101 |
5 | 133112102002132241 |
6 | 2450242201151345 |
7 | 164242555315040 |
oct | 23153526356521 |
9 | 4605414723032 |
10 | 1320121130321 |
11 | 469950a65214 |
12 | 193a21a8b555 |
13 | 97643903606 |
14 | 47c739a2557 |
15 | 2451561b89b |
hex | 1335d59dd51 |
1320121130321 has 32 divisors (see below), whose sum is σ = 1575323043840. Its totient is φ = 1082420697600.
The previous prime is 1320121130303. The next prime is 1320121130357. The reversal of 1320121130321 is 1230311210231.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1320121130321 - 26 = 1320121130257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1320121130293 and 1320121130302.
It is not an unprimeable number, because it can be changed into a prime (1320121130371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 89547011 + ... + 89561751.
It is an arithmetic number, because the mean of its divisors is an integer number (49228845120).
Almost surely, 21320121130321 is an apocalyptic number.
It is an amenable number.
1320121130321 is a deficient number, since it is larger than the sum of its proper divisors (255201913519).
1320121130321 is a wasteful number, since it uses less digits than its factorization.
1320121130321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19505.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1320121130321 its reverse (1230311210231), we get a palindrome (2550432340552).
The spelling of 1320121130321 in words is "one trillion, three hundred twenty billion, one hundred twenty-one million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •