Base | Representation |
---|---|
bin | 101111000011101100… |
… | …0010101001011011010 |
3 | 100122211201211211212110 |
4 | 1132013120111023122 |
5 | 3123430210101140 |
6 | 114231351053150 |
7 | 10205152001151 |
oct | 1360730251332 |
9 | 318751754773 |
10 | 101055550170 |
11 | 39948250613 |
12 | 177033711b6 |
13 | 96b63c9343 |
14 | 4c6930c598 |
15 | 2966c40380 |
hex | 17876152da |
101055550170 has 32 divisors (see below), whose sum is σ = 242554336128. Its totient is φ = 26945811648.
The previous prime is 101055550121. The next prime is 101055550171. The reversal of 101055550170 is 71055550101.
It is a super-2 number, since 2×1010555501702 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101055550171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 221187 + ... + 501033.
It is an arithmetic number, because the mean of its divisors is an integer number (7579823004).
Almost surely, 2101055550170 is an apocalyptic number.
101055550170 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101055550170 is an abundant number, since it is smaller than the sum of its proper divisors (141498785958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101055550170 is a wasteful number, since it uses less digits than its factorization.
101055550170 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291894.
The product of its (nonzero) digits is 4375, while the sum is 30.
The spelling of 101055550170 in words is "one hundred one billion, fifty-five million, five hundred fifty thousand, one hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •