Base | Representation |
---|---|
bin | 11101001001101001010… |
… | …110010000001111001101 |
3 | 21002111122222222122011201 |
4 | 131021221112100033031 |
5 | 230310044340420133 |
6 | 4132133443545501 |
7 | 264504466522645 |
oct | 35115126201715 |
9 | 7074588878151 |
10 | 2003222201293 |
11 | 70261a788365 |
12 | 2842a308b291 |
13 | 116b97ca7261 |
14 | 6cd567b7525 |
15 | 37195d13d7d |
hex | 1d2695903cd |
2003222201293 has 2 divisors, whose sum is σ = 2003222201294. Its totient is φ = 2003222201292.
The previous prime is 2003222201251. The next prime is 2003222201317. The reversal of 2003222201293 is 3921022223002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1129367422089 + 873854779204 = 1062717^2 + 934802^2 .
It is a cyclic number.
It is not a de Polignac number, because 2003222201293 - 29 = 2003222200781 is a prime.
It is a super-3 number, since 3×20032222012933 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2003222201203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001611100646 + 1001611100647.
It is an arithmetic number, because the mean of its divisors is an integer number (1001611100647).
Almost surely, 22003222201293 is an apocalyptic number.
It is an amenable number.
2003222201293 is a deficient number, since it is larger than the sum of its proper divisors (1).
2003222201293 is an equidigital number, since it uses as much as digits as its factorization.
2003222201293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 2003222201293 its reverse (3921022223002), we get a palindrome (5924244424295).
The spelling of 2003222201293 in words is "two trillion, three billion, two hundred twenty-two million, two hundred one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •