Base | Representation |
---|---|
bin | 10101001010000011010… |
… | …011111010000101010101 |
3 | 12010222202221002002101002 |
4 | 111022003103322011111 |
5 | 142310042401324424 |
6 | 3031525141113045 |
7 | 210020021631524 |
oct | 25120323720525 |
9 | 5128687062332 |
10 | 1453901979989 |
11 | 510661845698 |
12 | 1b59389b8785 |
13 | a7143b98aa4 |
14 | 505252564bb |
15 | 27c45366cae |
hex | 152834fa155 |
1453901979989 has 2 divisors, whose sum is σ = 1453901979990. Its totient is φ = 1453901979988.
The previous prime is 1453901979961. The next prime is 1453901980031. The reversal of 1453901979989 is 9899791093541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1313889062500 + 140012917489 = 1146250^2 + 374183^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1453901979989 is a prime.
It is a super-2 number, since 2×14539019799892 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1453901979289) 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, 726950989994 + 726950989995.
It is an arithmetic number, because the mean of its divisors is an integer number (726950989995).
Almost surely, 21453901979989 is an apocalyptic number.
It is an amenable number.
1453901979989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1453901979989 is an equidigital number, since it uses as much as digits as its factorization.
1453901979989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 198404640, while the sum is 74.
The spelling of 1453901979989 in words is "one trillion, four hundred fifty-three billion, nine hundred one million, nine hundred seventy-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •