Base | Representation |
---|---|
bin | 101111110010000000000100… |
… | …110011001111111111010101 |
3 | 1000120001121000102121221200022 |
4 | 233302000010303033333111 |
5 | 210021000401020334024 |
6 | 2022534533054554525 |
7 | 62156264115114446 |
oct | 5762000463177725 |
9 | 1016047012557608 |
10 | 210144240402389 |
11 | 60a5a743292597 |
12 | 1b69b440b08a45 |
13 | 903469465cb17 |
14 | 39c706d5d32cd |
15 | 194650211435e |
hex | bf2004ccffd5 |
210144240402389 has 2 divisors, whose sum is σ = 210144240402390. Its totient is φ = 210144240402388.
The previous prime is 210144240402307. The next prime is 210144240402457. The reversal of 210144240402389 is 983204042441012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 197712199074289 + 12432041328100 = 14061017^2 + 3525910^2 .
It is a cyclic number.
It is not a de Polignac number, because 210144240402389 - 228 = 210143971966933 is a prime.
It is a super-2 number, since 2×2101442404023892 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210144242402389) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105072120201194 + 105072120201195.
It is an arithmetic number, because the mean of its divisors is an integer number (105072120201195).
Almost surely, 2210144240402389 is an apocalyptic number.
It is an amenable number.
210144240402389 is a deficient number, since it is larger than the sum of its proper divisors (1).
210144240402389 is an equidigital number, since it uses as much as digits as its factorization.
210144240402389 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 442368, while the sum is 44.
The spelling of 210144240402389 in words is "two hundred ten trillion, one hundred forty-four billion, two hundred forty million, four hundred two thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •