Base | Representation |
---|---|
bin | 11110101101010001111… |
… | …01011011011110000110 |
3 | 10201212101211220221020110 |
4 | 33112220331123132012 |
5 | 114241322011204420 |
6 | 2124412414213450 |
7 | 136141255106115 |
oct | 17265075333606 |
9 | 3655354827213 |
10 | 1055101663110 |
11 | 377514422a50 |
12 | 15059b4b4286 |
13 | 78659c70921 |
14 | 390d253dc7c |
15 | 1c6a3e44ee0 |
hex | f5a8f5b786 |
1055101663110 has 32 divisors (see below), whose sum is σ = 2762447991552. Its totient is φ = 255782221280.
The previous prime is 1055101663081. The next prime is 1055101663141. The reversal of 1055101663110 is 113661015501.
It is a super-2 number, since 2×10551016631102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1598638554 + ... + 1598639213.
It is an arithmetic number, because the mean of its divisors is an integer number (86326499736).
Almost surely, 21055101663110 is an apocalyptic number.
1055101663110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1055101663110 is an abundant number, since it is smaller than the sum of its proper divisors (1707346328442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055101663110 is a wasteful number, since it uses less digits than its factorization.
1055101663110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3197277788.
The product of its (nonzero) digits is 2700, while the sum is 30.
Adding to 1055101663110 its reverse (113661015501), we get a palindrome (1168762678611).
The spelling of 1055101663110 in words is "one trillion, fifty-five billion, one hundred one million, six hundred sixty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •