Base | Representation |
---|---|
bin | 101111001011010011… |
… | …1100100001011110000 |
3 | 100200111112220022021221 |
4 | 1132112213210023300 |
5 | 3124441131431112 |
6 | 114313002354424 |
7 | 10214405002645 |
oct | 1362647441360 |
9 | 320445808257 |
10 | 101311202032 |
11 | 39a69594647 |
12 | 17774abba14 |
13 | 972736a431 |
14 | 4c91259dcc |
15 | 297e3dde07 |
hex | 17969e42f0 |
101311202032 has 40 divisors (see below), whose sum is σ = 206783372160. Its totient is φ = 47951928000.
The previous prime is 101311202011. The next prime is 101311202093. The reversal of 101311202032 is 230202113101.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 101311201997 and 101311202015.
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, 260157 + ... + 519907.
It is an arithmetic number, because the mean of its divisors is an integer number (5169584304).
Almost surely, 2101311202032 is an apocalyptic number.
It is an amenable number.
101311202032 is an abundant number, since it is smaller than the sum of its proper divisors (105472170128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101311202032 is a wasteful number, since it uses less digits than its factorization.
101311202032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261061 (or 261055 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101311202032 its reverse (230202113101), we get a palindrome (331513315133).
The spelling of 101311202032 in words is "one hundred one billion, three hundred eleven million, two hundred two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •