Base | Representation |
---|---|
bin | 11101000110101111010… |
… | …000110110010000111101 |
3 | 21002012121102102122201111 |
4 | 131012233100312100331 |
5 | 230232201124101023 |
6 | 4130500001042021 |
7 | 264334230243355 |
oct | 35065720662075 |
9 | 7065542378644 |
10 | 2000100222013 |
11 | 7012684840a3 |
12 | 283771626311 |
13 | 1167bb254c3a |
14 | 6cb3bcdbb65 |
15 | 37061bc800d |
hex | 1d1af43643d |
2000100222013 has 2 divisors, whose sum is σ = 2000100222014. Its totient is φ = 2000100222012.
The previous prime is 2000100222011. The next prime is 2000100222061. The reversal of 2000100222013 is 3102220010002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1957587143044 + 42513078969 = 1399138^2 + 206187^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000100222013 - 21 = 2000100222011 is a prime.
Together with 2000100222011, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2000100221984 and 2000100222002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000100222011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000050111006 + 1000050111007.
It is an arithmetic number, because the mean of its divisors is an integer number (1000050111007).
Almost surely, 22000100222013 is an apocalyptic number.
It is an amenable number.
2000100222013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000100222013 is an equidigital number, since it uses as much as digits as its factorization.
2000100222013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 2000100222013 its reverse (3102220010002), we get a palindrome (5102320232015).
The spelling of 2000100222013 in words is "two trillion, one hundred million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •