Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …0110101111100001001011 |
3 | 1102222112222210202212122121 |
4 | 2200031331012233201023 |
5 | 2420342141111133042 |
6 | 35225545315432111 |
7 | 2214311354462452 |
oct | 240157506574113 |
9 | 42875883685577 |
10 | 11010100099147 |
11 | 35653a2522996 |
12 | 12999b82b5637 |
13 | 61b32ba8b196 |
14 | 2a0c6ab13b99 |
15 | 1415e823b367 |
hex | a037d1af84b |
11010100099147 has 2 divisors, whose sum is σ = 11010100099148. Its totient is φ = 11010100099146.
The previous prime is 11010100099139. The next prime is 11010100099151. The reversal of 11010100099147 is 74199000101011.
11010100099147 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 not a de Polignac number, because 11010100099147 - 23 = 11010100099139 is a prime.
It is not a weakly prime, because it can be changed into another prime (11010100069147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505050049573 + 5505050049574.
It is an arithmetic number, because the mean of its divisors is an integer number (5505050049574).
Almost surely, 211010100099147 is an apocalyptic number.
11010100099147 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010100099147 is an equidigital number, since it uses as much as digits as its factorization.
11010100099147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2268, while the sum is 34.
The spelling of 11010100099147 in words is "eleven trillion, ten billion, one hundred million, ninety-nine thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •