Base | Representation |
---|---|
bin | 10011001101110001110… |
… | …011001011000110111011 |
3 | 11200020100102100112100001 |
4 | 103031301303023012323 |
5 | 133113302313400443 |
6 | 2450340214253431 |
7 | 164254222336405 |
oct | 23156163130673 |
9 | 4606312315301 |
10 | 1320464200123 |
11 | 46a007686682 |
12 | 193ab8957277 |
13 | 97699a012b3 |
14 | 47ca7387b75 |
15 | 245357d6d4d |
hex | 13371ccb1bb |
1320464200123 has 2 divisors, whose sum is σ = 1320464200124. Its totient is φ = 1320464200122.
The previous prime is 1320464200109. The next prime is 1320464200147. The reversal of 1320464200123 is 3210024640231.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (3210024640231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1320464200123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1320464200091 and 1320464200100.
It is not a weakly prime, because it can be changed into another prime (1320464200183) 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 as a sum of consecutive naturals, namely, 660232100061 + 660232100062.
It is an arithmetic number, because the mean of its divisors is an integer number (660232100062).
Almost surely, 21320464200123 is an apocalyptic number.
1320464200123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320464200123 is an equidigital number, since it uses as much as digits as its factorization.
1320464200123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 1320464200123 its reverse (3210024640231), we get a palindrome (4530488840354).
The spelling of 1320464200123 in words is "one trillion, three hundred twenty billion, four hundred sixty-four million, two hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •