Base | Representation |
---|---|
bin | 10110101111010101110000… |
… | …011100100001010100100101 |
3 | 111010002212210210102211101111 |
4 | 112233111300130201110211 |
5 | 101102031342200341234 |
6 | 552412015052225021 |
7 | 30031332662621614 |
oct | 2657256034412445 |
9 | 433085723384344 |
10 | 100010200012069 |
11 | 299590a6712216 |
12 | b27279176b171 |
13 | 43a5bc93c3049 |
14 | 1a9a73b75b87b |
15 | b86764eda664 |
hex | 5af570721525 |
100010200012069 has 2 divisors, whose sum is σ = 100010200012070. Its totient is φ = 100010200012068.
The previous prime is 100010200012049. The next prime is 100010200012111. The reversal of 100010200012069 is 960210002010001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58961665822500 + 41048534189569 = 7678650^2 + 6406913^2 .
It is a cyclic number.
It is not a de Polignac number, because 100010200012069 - 227 = 100010065794341 is a prime.
It is a super-2 number, since 2×1000102000120692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100010200012049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005100006034 + 50005100006035.
It is an arithmetic number, because the mean of its divisors is an integer number (50005100006035).
Almost surely, 2100010200012069 is an apocalyptic number.
It is an amenable number.
100010200012069 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010200012069 is an equidigital number, since it uses as much as digits as its factorization.
100010200012069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 100010200012069 in words is "one hundred trillion, ten billion, two hundred million, twelve thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •