Base | Representation |
---|---|
bin | 101111110001111111111110… |
… | …110101111001000000101011 |
3 | 1000120001120202110111220021012 |
4 | 233301333332311321000223 |
5 | 210021000144422301103 |
6 | 2022534515124134135 |
7 | 62156261462303033 |
oct | 5761777665710053 |
9 | 1016046673456235 |
10 | 210144140431403 |
11 | 60a5a6a1910942 |
12 | 1b69b41353734b |
13 | 9034679a295a9 |
14 | 39c706020c8c3 |
15 | 19464e84682d8 |
hex | bf1ffed7902b |
210144140431403 has 2 divisors, whose sum is σ = 210144140431404. Its totient is φ = 210144140431402.
The previous prime is 210144140431391. The next prime is 210144140431453. The reversal of 210144140431403 is 304134041441012.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 210144140431403 - 222 = 210144136237099 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210144140431403.
It is not a weakly prime, because it can be changed into another prime (210144140431453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105072070215701 + 105072070215702.
It is an arithmetic number, because the mean of its divisors is an integer number (105072070215702).
Almost surely, 2210144140431403 is an apocalyptic number.
210144140431403 is a deficient number, since it is larger than the sum of its proper divisors (1).
210144140431403 is an equidigital number, since it uses as much as digits as its factorization.
210144140431403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 210144140431403 its reverse (304134041441012), we get a palindrome (514278181872415).
The spelling of 210144140431403 in words is "two hundred ten trillion, one hundred forty-four billion, one hundred forty million, four hundred thirty-one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •