Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0001000011011001110 |
3 | 100122221220120120120020 |
4 | 1132022012020123032 |
5 | 3124023341022430 |
6 | 114240055403010 |
7 | 10206244156425 |
oct | 1361206103316 |
9 | 318856516506 |
10 | 101101110990 |
11 | 39970a3a090 |
12 | 17716683466 |
13 | 96c298bcc9 |
14 | 4c713ac2bc |
15 | 296ac3eb10 |
hex | 178a1886ce |
101101110990 has 32 divisors (see below), whose sum is σ = 264701091456. Its totient is φ = 24509360160.
The previous prime is 101101110989. The next prime is 101101111031. The reversal of 101101110990 is 99011101101.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101101110990.
It is a congruent number.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 153183172 + ... + 153183831.
It is an arithmetic number, because the mean of its divisors is an integer number (8271909108).
Almost surely, 2101101110990 is an apocalyptic number.
101101110990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101101110990 is an abundant number, since it is smaller than the sum of its proper divisors (163599980466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101110990 is a wasteful number, since it uses less digits than its factorization.
101101110990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306367024.
The product of its (nonzero) digits is 81, while the sum is 24.
The spelling of 101101110990 in words is "one hundred one billion, one hundred one million, one hundred ten thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •