Base | Representation |
---|---|
bin | 11101001000111001101… |
… | …01101101110001110001 |
3 | 10112201022010112221021211 |
4 | 32210130311231301301 |
5 | 112400440033120103 |
6 | 2043541115120121 |
7 | 132222642656611 |
oct | 16443465556161 |
9 | 3481263487254 |
10 | 1001211223153 |
11 | 35667a6a7869 |
12 | 14205b743041 |
13 | 7354c1bc52b |
14 | 3665d258a41 |
15 | 1b09cc6c36d |
hex | e91cd6dc71 |
1001211223153 has 2 divisors, whose sum is σ = 1001211223154. Its totient is φ = 1001211223152.
The previous prime is 1001211223151. The next prime is 1001211223211. The reversal of 1001211223153 is 3513221121001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 942010007184 + 59201215969 = 970572^2 + 243313^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001211223153 - 21 = 1001211223151 is a prime.
It is a super-2 number, since 2×10012112231532 (a number of 25 digits) contains 22 as substring.
Together with 1001211223151, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1001211223151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500605611576 + 500605611577.
It is an arithmetic number, because the mean of its divisors is an integer number (500605611577).
Almost surely, 21001211223153 is an apocalyptic number.
It is an amenable number.
1001211223153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001211223153 is an equidigital number, since it uses as much as digits as its factorization.
1001211223153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 1001211223153 its reverse (3513221121001), we get a palindrome (4514432344154).
The spelling of 1001211223153 in words is "one trillion, one billion, two hundred eleven million, two hundred twenty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •