Base | Representation |
---|---|
bin | 100000110100000… |
… | …0011101101111011 |
3 | 2211201202121112112 |
4 | 1001220003231323 |
5 | 4223330120102 |
6 | 301130402535 |
7 | 36166341632 |
oct | 10150035573 |
9 | 2751677475 |
10 | 1101020027 |
11 | 515551708 |
12 | 26889044b |
13 | 14714a053 |
14 | a6326519 |
15 | 669d8252 |
hex | 41a03b7b |
1101020027 has 8 divisors (see below), whose sum is σ = 1128407280. Its totient is φ = 1073658240.
The previous prime is 1101020021. The next prime is 1101020033. The reversal of 1101020027 is 7200201011.
It is an interprime number because it is at equal distance from previous prime (1101020021) and next prime (1101020033).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101020027 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101019993 and 1101020020.
It is not an unprimeable number, because it can be changed into a prime (1101020021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104999 + ... + 115007.
It is an arithmetic number, because the mean of its divisors is an integer number (141050910).
Almost surely, 21101020027 is an apocalyptic number.
1101020027 is a deficient number, since it is larger than the sum of its proper divisors (27387253).
1101020027 is a wasteful number, since it uses less digits than its factorization.
1101020027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12733.
The product of its (nonzero) digits is 28, while the sum is 14.
The square root of 1101020027 is about 33181.6218259446. The cubic root of 1101020027 is about 1032.5990937260.
Adding to 1101020027 its reverse (7200201011), we get a palindrome (8301221038).
The spelling of 1101020027 in words is "one billion, one hundred one million, twenty thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •