Base | Representation |
---|---|
bin | 101101110011011111001001… |
… | …101011010100110111110101 |
3 | 222102021110021020000002221201 |
4 | 231303133021223110313311 |
5 | 202401030040033144024 |
6 | 1552240543223212501 |
7 | 60301204416462316 |
oct | 5563371153246765 |
9 | 872243236002851 |
10 | 201450234662389 |
11 | 59208623740a49 |
12 | 1a7164a3ba7131 |
13 | 88538a2437c4b |
14 | 37a6359ba660d |
15 | 18452b2498744 |
hex | b737c9ad4df5 |
201450234662389 has 2 divisors, whose sum is σ = 201450234662390. Its totient is φ = 201450234662388.
The previous prime is 201450234662363. The next prime is 201450234662393. The reversal of 201450234662389 is 983266432054102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 201331750696164 + 118483966225 = 14189142^2 + 344215^2 .
It is a cyclic number.
It is not a de Polignac number, because 201450234662389 - 235 = 201415874924021 is a prime.
It is a super-2 number, since 2×2014502346623892 (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 (201450234662189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100725117331194 + 100725117331195.
It is an arithmetic number, because the mean of its divisors is an integer number (100725117331195).
Almost surely, 2201450234662389 is an apocalyptic number.
It is an amenable number.
201450234662389 is a deficient number, since it is larger than the sum of its proper divisors (1).
201450234662389 is an equidigital number, since it uses as much as digits as its factorization.
201450234662389 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14929920, while the sum is 55.
The spelling of 201450234662389 in words is "two hundred one trillion, four hundred fifty billion, two hundred thirty-four million, six hundred sixty-two thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •