Base | Representation |
---|---|
bin | 101111001011000000… |
… | …1111000001001011100 |
3 | 100200110212022100220010 |
4 | 1132112001320021130 |
5 | 3124431114303312 |
6 | 114312010523220 |
7 | 10214225014110 |
oct | 1362601701134 |
9 | 320425270803 |
10 | 101301322332 |
11 | 39a63a56901 |
12 | 17771736510 |
13 | 97252bb562 |
14 | 4c8dc07740 |
15 | 297d5db93c |
hex | 179607825c |
101301322332 has 24 divisors (see below), whose sum is σ = 270136859776. Its totient is φ = 28943234928.
The previous prime is 101301322273. The next prime is 101301322357. The reversal of 101301322332 is 233223103101.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 101301322299 and 101301322308.
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 7 ways as a sum of consecutive naturals, for example, 602983978 + ... + 602984145.
Almost surely, 2101301322332 is an apocalyptic number.
101301322332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101301322332 is an abundant number, since it is smaller than the sum of its proper divisors (168835537444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101301322332 is a wasteful number, since it uses less digits than its factorization.
101301322332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1205968137 (or 1205968135 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 101301322332 its reverse (233223103101), we get a palindrome (334524425433).
The spelling of 101301322332 in words is "one hundred one billion, three hundred one million, three hundred twenty-two thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •