Base | Representation |
---|---|
bin | 101111001011111100… |
… | …0001000101100111011 |
3 | 100200120000122100222212 |
4 | 1132113320020230323 |
5 | 3130012033320011 |
6 | 114315035205335 |
7 | 10215052351334 |
oct | 1362770105473 |
9 | 320500570885 |
10 | 101332323131 |
11 | 39a7a5001a6 |
12 | 1777bba684b |
13 | 972b853c20 |
14 | 4c93d9728b |
15 | 29811b208b |
hex | 1797e08b3b |
101332323131 has 8 divisors (see below), whose sum is σ = 112890121680. Its totient is φ = 90312096672.
The previous prime is 101332323121. The next prime is 101332323137. The reversal of 101332323131 is 131323233101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101332323131 is a prime.
It is a super-2 number, since 2×1013323231312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101332323097 and 101332323106.
It is not an unprimeable number, because it can be changed into a prime (101332323137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 134392625 + ... + 134393378.
It is an arithmetic number, because the mean of its divisors is an integer number (14111265210).
Almost surely, 2101332323131 is an apocalyptic number.
101332323131 is a deficient number, since it is larger than the sum of its proper divisors (11557798549).
101332323131 is a wasteful number, since it uses less digits than its factorization.
101332323131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268786045.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 101332323131 its reverse (131323233101), we get a palindrome (232655556232).
The spelling of 101332323131 in words is "one hundred one billion, three hundred thirty-two million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •