Base | Representation |
---|---|
bin | 10110101111010110100110… |
… | …001001111011111100111001 |
3 | 111010002222010121000100110122 |
4 | 112233112212021323330321 |
5 | 101102040213341010243 |
6 | 552412244322023025 |
7 | 30031364214052526 |
oct | 2657264611737471 |
9 | 433088117010418 |
10 | 100011101110073 |
11 | 2995951932450a |
12 | b2729a34a7a75 |
13 | 43a6010cb242a |
14 | 1a9a7c52c214d |
15 | b867b9182668 |
hex | 5af5a627bf39 |
100011101110073 has 2 divisors, whose sum is σ = 100011101110074. Its totient is φ = 100011101110072.
The previous prime is 100011101110051. The next prime is 100011101110103. The reversal of 100011101110073 is 370011101110001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75066750107449 + 24944351002624 = 8664107^2 + 4994432^2 .
It is a cyclic number.
It is not a de Polignac number, because 100011101110073 - 212 = 100011101105977 is a prime.
It is not a weakly prime, because it can be changed into another prime (100011101110673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005550555036 + 50005550555037.
It is an arithmetic number, because the mean of its divisors is an integer number (50005550555037).
Almost surely, 2100011101110073 is an apocalyptic number.
It is an amenable number.
100011101110073 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011101110073 is an equidigital number, since it uses as much as digits as its factorization.
100011101110073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 17.
Adding to 100011101110073 its reverse (370011101110001), we get a palindrome (470022202220074).
The spelling of 100011101110073 in words is "one hundred trillion, eleven billion, one hundred one million, one hundred ten thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •