Base | Representation |
---|---|
bin | 101111000101010110… |
… | …0101110111001010000 |
3 | 100122222121121200021120 |
4 | 1132022230232321100 |
5 | 3124033433330112 |
6 | 114241100322240 |
7 | 10206426163131 |
oct | 1361254567120 |
9 | 318877550246 |
10 | 101111230032 |
11 | 3997672072a |
12 | 17719b43380 |
13 | 96c4ac2ac7 |
14 | 4c72883c88 |
15 | 296ba8ce8c |
hex | 178ab2ee50 |
101111230032 has 40 divisors (see below), whose sum is σ = 261215394240. Its totient is φ = 33702274560.
The previous prime is 101111230009. The next prime is 101111230061. The reversal of 101111230032 is 230032111101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101111229993 and 101111230020.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2152557 + ... + 2199027.
It is an arithmetic number, because the mean of its divisors is an integer number (6530384856).
Almost surely, 2101111230032 is an apocalyptic number.
101111230032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101111230032 is an abundant number, since it is smaller than the sum of its proper divisors (160104164208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111230032 is a wasteful number, since it uses less digits than its factorization.
101111230032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91811 (or 91805 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 101111230032 its reverse (230032111101), we get a palindrome (331143341133).
The spelling of 101111230032 in words is "one hundred one billion, one hundred eleven million, two hundred thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •