Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …010100001011001110111001 |
3 | 222100200102011102122021000121 |
4 | 231230323312110023032321 |
5 | 202321141011033032413 |
6 | 1551254044125133241 |
7 | 60223525450142503 |
oct | 5554736624131671 |
9 | 870612142567017 |
10 | 201000012002233 |
11 | 59054698796744 |
12 | 1a6631953ba221 |
13 | 88202b1b9a722 |
14 | 378c6498b2d73 |
15 | 18387118c6b8d |
hex | b6cef650b3b9 |
201000012002233 has 2 divisors, whose sum is σ = 201000012002234. Its totient is φ = 201000012002232.
The previous prime is 201000012002129. The next prime is 201000012002323. The reversal of 201000012002233 is 332200210000102.
Together with next prime (201000012002323) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 199306403878464 + 1693608123769 = 14117592^2 + 1301387^2 .
It is a cyclic number.
It is not a de Polignac number, because 201000012002233 - 229 = 200999475131321 is a prime.
It is not a weakly prime, because it can be changed into another prime (201000012002633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500006001116 + 100500006001117.
It is an arithmetic number, because the mean of its divisors is an integer number (100500006001117).
Almost surely, 2201000012002233 is an apocalyptic number.
It is an amenable number.
201000012002233 is a deficient number, since it is larger than the sum of its proper divisors (1).
201000012002233 is an equidigital number, since it uses as much as digits as its factorization.
201000012002233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 201000012002233 its reverse (332200210000102), we get a palindrome (533200222002335).
The spelling of 201000012002233 in words is "two hundred one trillion, twelve million, two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •