Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0001011000100110001 |
3 | 101112012001120120001112 |
4 | 1212202132023010301 |
5 | 3300441100013243 |
6 | 122325041043105 |
7 | 10645244365526 |
oct | 1464236130461 |
9 | 345161516045 |
10 | 110100001073 |
11 | 42769642427 |
12 | 19408326495 |
13 | a4c814103a |
14 | 54865b514d |
15 | 2ce5c9c818 |
hex | 19a278b131 |
110100001073 has 2 divisors, whose sum is σ = 110100001074. Its totient is φ = 110100001072.
The previous prime is 110100001049. The next prime is 110100001093. The reversal of 110100001073 is 370100001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100395189904 + 9704811169 = 316852^2 + 98513^2 .
It is a cyclic number.
It is not a de Polignac number, because 110100001073 - 26 = 110100001009 is a prime.
It is not a weakly prime, because it can be changed into another prime (110100001093) 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 as a sum of consecutive naturals, namely, 55050000536 + 55050000537.
It is an arithmetic number, because the mean of its divisors is an integer number (55050000537).
Almost surely, 2110100001073 is an apocalyptic number.
It is an amenable number.
110100001073 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100001073 is an equidigital number, since it uses as much as digits as its factorization.
110100001073 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 14.
Adding to 110100001073 its reverse (370100001011), we get a palindrome (480200002084).
The spelling of 110100001073 in words is "one hundred ten billion, one hundred million, one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •