Base | Representation |
---|---|
bin | 10100100001010100010… |
… | …110101011001111000101 |
3 | 11222210212210022001222012 |
4 | 110201110112223033011 |
5 | 141101004103102433 |
6 | 2555453131144005 |
7 | 203611122336014 |
oct | 24412426531705 |
9 | 4883783261865 |
10 | 1410164503493 |
11 | 4a40581101a9 |
12 | 1a93712a5005 |
13 | a2c93700895 |
14 | 4c376550a7b |
15 | 26a356b4848 |
hex | 148545ab3c5 |
1410164503493 has 2 divisors, whose sum is σ = 1410164503494. Its totient is φ = 1410164503492.
The previous prime is 1410164503469. The next prime is 1410164503537. The reversal of 1410164503493 is 3943054610141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1292036875684 + 118127627809 = 1136678^2 + 343697^2 .
It is a cyclic number.
It is not a de Polignac number, because 1410164503493 - 222 = 1410160309189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1410164503493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1410164503403) 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, 705082251746 + 705082251747.
It is an arithmetic number, because the mean of its divisors is an integer number (705082251747).
Almost surely, 21410164503493 is an apocalyptic number.
It is an amenable number.
1410164503493 is a deficient number, since it is larger than the sum of its proper divisors (1).
1410164503493 is an equidigital number, since it uses as much as digits as its factorization.
1410164503493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 41.
The spelling of 1410164503493 in words is "one trillion, four hundred ten billion, one hundred sixty-four million, five hundred three thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •