Base | Representation |
---|---|
bin | 11101101100000101011… |
… | …00101110100011000101 |
3 | 10121112001112010211201102 |
4 | 32312002230232203011 |
5 | 113203131100342404 |
6 | 2100343311305445 |
7 | 133462013015534 |
oct | 16660254564305 |
9 | 3545045124642 |
10 | 1020100012229 |
11 | 363692954651 |
12 | 14585151b285 |
13 | 7526c5bc6bc |
14 | 37531b2431b |
15 | 1b80618a71e |
hex | ed82b2e8c5 |
1020100012229 has 2 divisors, whose sum is σ = 1020100012230. Its totient is φ = 1020100012228.
The previous prime is 1020100012049. The next prime is 1020100012339. The reversal of 1020100012229 is 9222100010201.
It is a happy number.
1020100012229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 924486096004 + 95613916225 = 961502^2 + 309215^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020100012229 - 224 = 1020083235013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1020100012229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020106012229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510050006114 + 510050006115.
It is an arithmetic number, because the mean of its divisors is an integer number (510050006115).
Almost surely, 21020100012229 is an apocalyptic number.
It is an amenable number.
1020100012229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020100012229 is an equidigital number, since it uses as much as digits as its factorization.
1020100012229 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 20.
The spelling of 1020100012229 in words is "one trillion, twenty billion, one hundred million, twelve thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •