Base | Representation |
---|---|
bin | 10101001010000011010… |
… | …011111010010010010011 |
3 | 12010222202221002010111211 |
4 | 111022003103322102103 |
5 | 142310042401341234 |
6 | 3031525141120551 |
7 | 210020021634121 |
oct | 25120323722223 |
9 | 5128687063454 |
10 | 1453901980819 |
11 | 510661846282 |
12 | 1b59389b9157 |
13 | a7143b99292 |
14 | 50525256911 |
15 | 27c45367164 |
hex | 152834fa493 |
1453901980819 has 2 divisors, whose sum is σ = 1453901980820. Its totient is φ = 1453901980818.
The previous prime is 1453901980781. The next prime is 1453901980831. The reversal of 1453901980819 is 9180891093541.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1453901980819 is a prime.
It is a super-2 number, since 2×14539019808192 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1453901990819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 726950990409 + 726950990410.
It is an arithmetic number, because the mean of its divisors is an integer number (726950990410).
Almost surely, 21453901980819 is an apocalyptic number.
1453901980819 is a deficient number, since it is larger than the sum of its proper divisors (1).
1453901980819 is an equidigital number, since it uses as much as digits as its factorization.
1453901980819 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2799360, while the sum is 58.
The spelling of 1453901980819 in words is "one trillion, four hundred fifty-three billion, nine hundred one million, nine hundred eighty thousand, eight hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •