Base | Representation |
---|---|
bin | 10110110000110100110001… |
… | …010100101010010001011001 |
3 | 111010110122010202102110100012 |
4 | 112300310301110222101121 |
5 | 101110214311332431243 |
6 | 552530530303051305 |
7 | 30041604100132112 |
oct | 2660646124522131 |
9 | 433418122373305 |
10 | 100112220202073 |
11 | 29998399424a32 |
12 | b28a503ba0b35 |
13 | 43b27075c8891 |
14 | 1aa1658c11209 |
15 | b89236774d18 |
hex | 5b0d3152a459 |
100112220202073 has 2 divisors, whose sum is σ = 100112220202074. Its totient is φ = 100112220202072.
The previous prime is 100112220202051. The next prime is 100112220202081. The reversal of 100112220202073 is 370202022211001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57983397190489 + 42128823011584 = 7614683^2 + 6490672^2 .
It is an emirp because it is prime and its reverse (370202022211001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100112220202073 - 232 = 100107925234777 is a prime.
It is not a weakly prime, because it can be changed into another prime (100112220202013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50056110101036 + 50056110101037.
It is an arithmetic number, because the mean of its divisors is an integer number (50056110101037).
Almost surely, 2100112220202073 is an apocalyptic number.
It is an amenable number.
100112220202073 is a deficient number, since it is larger than the sum of its proper divisors (1).
100112220202073 is an equidigital number, since it uses as much as digits as its factorization.
100112220202073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 100112220202073 its reverse (370202022211001), we get a palindrome (470314242413074).
The spelling of 100112220202073 in words is "one hundred trillion, one hundred twelve billion, two hundred twenty million, two hundred two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •