Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …1010001010110001101000 |
3 | 1022102000000011102100021122 |
4 | 2101201110122022301220 |
5 | 2302320201100323422 |
6 | 33133552120354412 |
7 | 2051324541414011 |
oct | 221412432126150 |
9 | 38360004370248 |
10 | 10000100011112 |
11 | 3206022832932 |
12 | 1156105315a08 |
13 | 57700baa40b3 |
14 | 268016524008 |
15 | 1251d3aead42 |
hex | 9185468ac68 |
10000100011112 has 24 divisors (see below), whose sum is σ = 18978815256690. Its totient is φ = 4939808412000.
The previous prime is 10000100011087. The next prime is 10000100011117. The reversal of 10000100011112 is 21111000100001.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 9411679079716 + 588420931396 = 3067846^2 + 767086^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 10000100011112.
It is not an unprimeable number, because it can be changed into a prime (10000100011117) 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 in 5 ways as a sum of consecutive naturals, for example, 90670139 + ... + 90780362.
Almost surely, 210000100011112 is an apocalyptic number.
It is an amenable number.
10000100011112 is a deficient number, since it is larger than the sum of its proper divisors (8978715245578).
10000100011112 is an equidigital number, since it uses as much as digits as its factorization.
10000100011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181450673 (or 181450586 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10000100011112 its reverse (21111000100001), we get a palindrome (31111100111113).
The spelling of 10000100011112 in words is "ten trillion, one hundred million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •