Base | Representation |
---|---|
bin | 101111000101000110… |
… | …1011010110001001100 |
3 | 100122222001011121210020 |
4 | 1132022031122301030 |
5 | 3124024333134012 |
6 | 114240204342140 |
7 | 10206266333361 |
oct | 1361215326114 |
9 | 318861147706 |
10 | 101103021132 |
11 | 39972024213 |
12 | 17717244950 |
13 | 96c31aa579 |
14 | 4c71748468 |
15 | 296aebaa8c |
hex | 178a35ac4c |
101103021132 has 48 divisors (see below), whose sum is σ = 236649584640. Its totient is φ = 33595069248.
The previous prime is 101103021119. The next prime is 101103021157. The reversal of 101103021132 is 231120301101.
It is a happy number.
101103021132 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1011030211322 (a number of 23 digits) contains 22 as substring.
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, 6440469 + ... + 6456147.
It is an arithmetic number, because the mean of its divisors is an integer number (4930199680).
Almost surely, 2101103021132 is an apocalyptic number.
101103021132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101103021132 is an abundant number, since it is smaller than the sum of its proper divisors (135546563508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101103021132 is a wasteful number, since it uses less digits than its factorization.
101103021132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17342 (or 17340 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 101103021132 its reverse (231120301101), we get a palindrome (332223322233).
The spelling of 101103021132 in words is "one hundred one billion, one hundred three million, twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •