Base | Representation |
---|---|
bin | 101111110110010011101001… |
… | …110100001111110001111101 |
3 | 1000121002212210012201102000212 |
4 | 233312103221310033301331 |
5 | 210040322401422003034 |
6 | 2023322511011202205 |
7 | 62216540566563242 |
oct | 5766235164176175 |
9 | 1017085705642025 |
10 | 210440140422269 |
11 | 6106418711806a |
12 | 1b7288612a6365 |
13 | 905655cc32594 |
14 | 39d74dddd75c9 |
15 | 194e06e89e2ce |
hex | bf64e9d0fc7d |
210440140422269 has 2 divisors, whose sum is σ = 210440140422270. Its totient is φ = 210440140422268.
The previous prime is 210440140422167. The next prime is 210440140422287. The reversal of 210440140422269 is 962224041044012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 196063341116644 + 14376799305625 = 14002262^2 + 3791675^2 .
It is a cyclic number.
It is not a de Polignac number, because 210440140422269 - 244 = 192847954377853 is a prime.
It is a super-2 number, since 2×2104401404222692 (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 (210440140425269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105220070211134 + 105220070211135.
It is an arithmetic number, because the mean of its divisors is an integer number (105220070211135).
Almost surely, 2210440140422269 is an apocalyptic number.
It is an amenable number.
210440140422269 is a deficient number, since it is larger than the sum of its proper divisors (1).
210440140422269 is an equidigital number, since it uses as much as digits as its factorization.
210440140422269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 221184, while the sum is 41.
The spelling of 210440140422269 in words is "two hundred ten trillion, four hundred forty billion, one hundred forty million, four hundred twenty-two thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •