Base | Representation |
---|---|
bin | 10000000010011010010… |
… | …101101011001101110001 |
3 | 10220100201022110200101022 |
4 | 100002122111223031301 |
5 | 121024100324013243 |
6 | 2202144225145225 |
7 | 142424042641052 |
oct | 20023225531561 |
9 | 3810638420338 |
10 | 1102101001073 |
11 | 395442313216 |
12 | 15971748b215 |
13 | 7cc0a156987 |
14 | 3b4b0534729 |
15 | 1da05164b68 |
hex | 1009a56b371 |
1102101001073 has 2 divisors, whose sum is σ = 1102101001074. Its totient is φ = 1102101001072.
The previous prime is 1102101001037. The next prime is 1102101001121. The reversal of 1102101001073 is 3701001012011.
Together with previous prime (1102101001037) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 978008257249 + 124092743824 = 988943^2 + 352268^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102101001073 - 28 = 1102101000817 is a prime.
It is a super-2 number, since 2×11021010010732 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1102101001873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551050500536 + 551050500537.
It is an arithmetic number, because the mean of its divisors is an integer number (551050500537).
Almost surely, 21102101001073 is an apocalyptic number.
It is an amenable number.
1102101001073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102101001073 is an equidigital number, since it uses as much as digits as its factorization.
1102101001073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42, while the sum is 17.
Adding to 1102101001073 its reverse (3701001012011), we get a palindrome (4803102013084).
The spelling of 1102101001073 in words is "one trillion, one hundred two billion, one hundred one million, one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •