Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1111110001111001010 |
3 | 100200020111200212102000 |
4 | 1132100211332033022 |
5 | 3124234242334122 |
6 | 114254552051430 |
7 | 10212036556353 |
oct | 1362045761712 |
9 | 320214625360 |
10 | 101210121162 |
11 | 39a17525037 |
12 | 17747093b76 |
13 | 970c438977 |
14 | 4c81a66d2a |
15 | 29755c40ac |
hex | 179097e3ca |
101210121162 has 64 divisors (see below), whose sum is σ = 233171136000. Its totient is φ = 32502786624.
The previous prime is 101210121161. The next prime is 101210121209. The reversal of 101210121162 is 261121012101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (101210121161) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 655264 + ... + 794852.
It is an arithmetic number, because the mean of its divisors is an integer number (3643299000).
Almost surely, 2101210121162 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101210121162, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116585568000).
101210121162 is an abundant number, since it is smaller than the sum of its proper divisors (131961014838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101210121162 is a wasteful number, since it uses less digits than its factorization.
101210121162 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140092 (or 140086 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 101210121162 its reverse (261121012101), we get a palindrome (362331133263).
The spelling of 101210121162 in words is "one hundred one billion, two hundred ten million, one hundred twenty-one thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •