Base | Representation |
---|---|
bin | 101111001000111110… |
… | …1101101001110000011 |
3 | 100200022002222100001200 |
4 | 1132101331231032003 |
5 | 3124311134321011 |
6 | 114301133032243 |
7 | 10212436215633 |
oct | 1362175551603 |
9 | 320262870050 |
10 | 101233120131 |
11 | 39a29503550 |
12 | 17752925683 |
13 | 971412c120 |
14 | 4c84b326c3 |
15 | 2977618856 |
hex | 1791f6d383 |
101233120131 has 96 divisors (see below), whose sum is σ = 179728174080. Its totient is φ = 54075686400.
The previous prime is 101233120067. The next prime is 101233120133. The reversal of 101233120131 is 131021332101.
101233120131 is a `hidden beast` number, since 101 + 2 + 331 + 201 + 31 = 666.
It is not a de Polignac number, because 101233120131 - 26 = 101233120067 is a prime.
It is a super-2 number, since 2×1012331201312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101233120133) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2459640 + ... + 2500458.
It is an arithmetic number, because the mean of its divisors is an integer number (1872168480).
Almost surely, 2101233120131 is an apocalyptic number.
101233120131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101233120131 is a deficient number, since it is larger than the sum of its proper divisors (78495053949).
101233120131 is a wasteful number, since it uses less digits than its factorization.
101233120131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40937 (or 40934 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 101233120131 its reverse (131021332101), we get a palindrome (232254452232).
The spelling of 101233120131 in words is "one hundred one billion, two hundred thirty-three million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •