Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …1010111100001011011111 |
3 | 1022102000000011210121212102 |
4 | 2101201110122330023133 |
5 | 2302320201123312341 |
6 | 33133552124555315 |
7 | 2051324543215664 |
oct | 221412432741337 |
9 | 38360004717772 |
10 | 10000100213471 |
11 | 3206022960975 |
12 | 11561053b2b3b |
13 | 57700bb45234 |
14 | 268016577a6b |
15 | 1251d3b3ac9b |
hex | 918546bc2df |
10000100213471 has 2 divisors, whose sum is σ = 10000100213472. Its totient is φ = 10000100213470.
The previous prime is 10000100213413. The next prime is 10000100213479. The reversal of 10000100213471 is 17431200100001.
It is a happy number.
10000100213471 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10000100213471 is a prime.
It is a super-3 number, since 3×100001002134713 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000100213479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000050106735 + 5000050106736.
It is an arithmetic number, because the mean of its divisors is an integer number (5000050106736).
Almost surely, 210000100213471 is an apocalyptic number.
10000100213471 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000100213471 is an equidigital number, since it uses as much as digits as its factorization.
10000100213471 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 10000100213471 its reverse (17431200100001), we get a palindrome (27431300313472).
The spelling of 10000100213471 in words is "ten trillion, one hundred million, two hundred thirteen thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.317 sec. • engine limits •