Base | Representation |
---|---|
bin | 101111000101101001… |
… | …1010001011110001100 |
3 | 100200000022121222010110 |
4 | 1132023103101132030 |
5 | 3124044030130012 |
6 | 114242101040020 |
7 | 10206611102211 |
oct | 1361323213614 |
9 | 320008558113 |
10 | 101121333132 |
11 | 399813a12a6 |
12 | 177213b6010 |
13 | 96c6c1c581 |
14 | 4c73d53b08 |
15 | 296c8d673c |
hex | 178b4d178c |
101121333132 has 24 divisors (see below), whose sum is σ = 248368187200. Its totient is φ = 31933052496.
The previous prime is 101121333029. The next prime is 101121333133. The reversal of 101121333132 is 231333121101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101121333099 and 101121333108.
It is not an unprimeable number, because it can be changed into a prime (101121333133) 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 7 ways as a sum of consecutive naturals, for example, 221757082 + ... + 221757537.
Almost surely, 2101121333132 is an apocalyptic number.
101121333132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101121333132 is an abundant number, since it is smaller than the sum of its proper divisors (147246854068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121333132 is a wasteful number, since it uses less digits than its factorization.
101121333132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443514645 (or 443514643 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 101121333132 its reverse (231333121101), we get a palindrome (332454454233).
The spelling of 101121333132 in words is "one hundred one billion, one hundred twenty-one million, three hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •