Base | Representation |
---|---|
bin | 101111000101111100… |
… | …0111101100101000010 |
3 | 100200001000012220221000 |
4 | 1132023320331211002 |
5 | 3124104042304442 |
6 | 114243052512430 |
7 | 10210061061642 |
oct | 1361370754502 |
9 | 320030186830 |
10 | 101131213122 |
11 | 39986a2a285 |
12 | 1772477b716 |
13 | 96c8c9b614 |
14 | 4c753a6522 |
15 | 296d6d8d4c |
hex | 178be3d942 |
101131213122 has 128 divisors (see below), whose sum is σ = 232071840000. Its totient is φ = 32631330816.
The previous prime is 101131213109. The next prime is 101131213199. The reversal of 101131213122 is 221312131101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 101131213095 and 101131213104.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 70769904 + ... + 70771332.
It is an arithmetic number, because the mean of its divisors is an integer number (1813061250).
Almost surely, 2101131213122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101131213122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116035920000).
101131213122 is an abundant number, since it is smaller than the sum of its proper divisors (130940626878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101131213122 is a wasteful number, since it uses less digits than its factorization.
101131213122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1825 (or 1819 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 101131213122 its reverse (221312131101), we get a palindrome (322443344223).
The spelling of 101131213122 in words is "one hundred one billion, one hundred thirty-one million, two hundred thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •