Base | Representation |
---|---|
bin | 11101000111000001001… |
… | …00010010010001111001 |
3 | 10112121200122210112212102 |
4 | 32203200210102101321 |
5 | 112341402201133423 |
6 | 2043252513353145 |
7 | 132155613621656 |
oct | 16434044222171 |
9 | 3477618715772 |
10 | 1000200021113 |
11 | 3562009227a7 |
12 | 141a18b687b5 |
13 | 7341a85c627 |
14 | 365a4c32c2d |
15 | 1b03e0c6c28 |
hex | e8e0912479 |
1000200021113 has 2 divisors, whose sum is σ = 1000200021114. Its totient is φ = 1000200021112.
The previous prime is 1000200021091. The next prime is 1000200021179. The reversal of 1000200021113 is 3111200020001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 809922601849 + 190277419264 = 899957^2 + 436208^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000200021113 - 222 = 1000195826809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000200021094 and 1000200021103.
It is not a weakly prime, because it can be changed into another prime (1000200026113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500100010556 + 500100010557.
It is an arithmetic number, because the mean of its divisors is an integer number (500100010557).
Almost surely, 21000200021113 is an apocalyptic number.
It is an amenable number.
1000200021113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000200021113 is an equidigital number, since it uses as much as digits as its factorization.
1000200021113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1000200021113 its reverse (3111200020001), we get a palindrome (4111400041114).
The spelling of 1000200021113 in words is "one trillion, two hundred million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •