Base | Representation |
---|---|
bin | 10111000010100101000011… |
… | …110011101010101011000011 |
3 | 111021210021101021202102120020 |
4 | 113002211003303222223003 |
5 | 101240212023031012011 |
6 | 555303225541344523 |
7 | 30226005612103161 |
oct | 2702450363525303 |
9 | 437707337672506 |
10 | 101332301032131 |
11 | 2a318873228944 |
12 | b446a66708143 |
13 | 447079724c340 |
14 | 1b0471c262231 |
15 | baad44346006 |
hex | 5c2943ceaac3 |
101332301032131 has 16 divisors (see below), whose sum is σ = 145503029898240. Its totient is φ = 62358236808480.
The previous prime is 101332301032111. The next prime is 101332301032139. The reversal of 101332301032131 is 131230103233101.
It is not a de Polignac number, because 101332301032131 - 213 = 101332301023939 is a prime.
It is a super-2 number, since 2×1013323010321312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101332301032139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26985196 + ... + 30510086.
It is an arithmetic number, because the mean of its divisors is an integer number (9093939368640).
Almost surely, 2101332301032131 is an apocalyptic number.
101332301032131 is a deficient number, since it is larger than the sum of its proper divisors (44170728866109).
101332301032131 is a wasteful number, since it uses less digits than its factorization.
101332301032131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4262026.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 101332301032131 its reverse (131230103233101), we get a palindrome (232562404265232).
The spelling of 101332301032131 in words is "one hundred one trillion, three hundred thirty-two billion, three hundred one million, thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •