Base | Representation |
---|---|
bin | 11111111000100001111110… |
… | …111100101100100100011111 |
3 | 200101111022020010201102110102 |
4 | 133320201332330230210133 |
5 | 121334413201330321343 |
6 | 1214122041321131315 |
7 | 41351602641620303 |
oct | 3770417674544437 |
9 | 611438203642412 |
10 | 140224222120223 |
11 | 4075283882691a |
12 | 13888488329b3b |
13 | 603211a059697 |
14 | 268ac62307d03 |
15 | 11328491ca3b8 |
hex | 7f887ef2c91f |
140224222120223 has 2 divisors, whose sum is σ = 140224222120224. Its totient is φ = 140224222120222.
The previous prime is 140224222120217. The next prime is 140224222120231. The reversal of 140224222120223 is 322021222422041.
It is a weak prime.
It is an emirp because it is prime and its reverse (322021222422041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140224222120223 - 212 = 140224222116127 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140224222120253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70112111060111 + 70112111060112.
It is an arithmetic number, because the mean of its divisors is an integer number (70112111060112).
Almost surely, 2140224222120223 is an apocalyptic number.
140224222120223 is a deficient number, since it is larger than the sum of its proper divisors (1).
140224222120223 is an equidigital number, since it uses as much as digits as its factorization.
140224222120223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12288, while the sum is 29.
Adding to 140224222120223 its reverse (322021222422041), we get a palindrome (462245444542264).
The spelling of 140224222120223 in words is "one hundred forty trillion, two hundred twenty-four billion, two hundred twenty-two million, one hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •