Base | Representation |
---|---|
bin | 10101000101111000010… |
… | …100110000010011011001 |
3 | 12010120012202111100100112 |
4 | 111011320110300103121 |
5 | 142221404201413101 |
6 | 3025504450214105 |
7 | 206501021355605 |
oct | 25057024602331 |
9 | 5116182440315 |
10 | 1449422685401 |
11 | 509773357339 |
12 | 1b4aa8884335 |
13 | a68abb91812 |
14 | 5021c3ba505 |
15 | 27a81eb86bb |
hex | 151785304d9 |
1449422685401 has 2 divisors, whose sum is σ = 1449422685402. Its totient is φ = 1449422685400.
The previous prime is 1449422685397. The next prime is 1449422685437. The reversal of 1449422685401 is 1045862249441.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1038187777225 + 411234908176 = 1018915^2 + 641276^2 .
It is a cyclic number.
It is not a de Polignac number, because 1449422685401 - 22 = 1449422685397 is a prime.
It is a super-2 number, since 2×14494226854012 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1449422685401.
It is not a weakly prime, because it can be changed into another prime (1449422685461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 724711342700 + 724711342701.
It is an arithmetic number, because the mean of its divisors is an integer number (724711342701).
Almost surely, 21449422685401 is an apocalyptic number.
It is an amenable number.
1449422685401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1449422685401 is an equidigital number, since it uses as much as digits as its factorization.
1449422685401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2211840, while the sum is 50.
The spelling of 1449422685401 in words is "one trillion, four hundred forty-nine billion, four hundred twenty-two million, six hundred eighty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •