Base | Representation |
---|---|
bin | 10100101010111001000… |
… | …000111100101000011101 |
3 | 12000210102010120001001112 |
4 | 110222321000330220131 |
5 | 141233031432202424 |
6 | 3004313112151405 |
7 | 204423623222513 |
oct | 24527100745035 |
9 | 5023363501045 |
10 | 1420443240989 |
11 | 4a84521a6883 |
12 | 1ab35b698565 |
13 | a3c41082b86 |
14 | 4ca6d7104b3 |
15 | 26e37c8160e |
hex | 14ab903ca1d |
1420443240989 has 2 divisors, whose sum is σ = 1420443240990. Its totient is φ = 1420443240988.
The previous prime is 1420443240973. The next prime is 1420443241033. The reversal of 1420443240989 is 9890423440241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1417190249764 + 3252991225 = 1190458^2 + 57035^2 .
It is a cyclic number.
It is not a de Polignac number, because 1420443240989 - 24 = 1420443240973 is a prime.
It is a super-4 number, since 4×14204432409894 (a number of 50 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1420443240389) 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, 710221620494 + 710221620495.
It is an arithmetic number, because the mean of its divisors is an integer number (710221620495).
Almost surely, 21420443240989 is an apocalyptic number.
It is an amenable number.
1420443240989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1420443240989 is an equidigital number, since it uses as much as digits as its factorization.
1420443240989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1990656, while the sum is 50.
The spelling of 1420443240989 in words is "one trillion, four hundred twenty billion, four hundred forty-three million, two hundred forty thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •