Base | Representation |
---|---|
bin | 101111001000100111… |
… | …1011110001110111010 |
3 | 100200021021011120112110 |
4 | 1132101033132032322 |
5 | 3124300034000442 |
6 | 114300021153150 |
7 | 10212231206424 |
oct | 1362117361672 |
9 | 320237146473 |
10 | 101221000122 |
11 | 39a22685610 |
12 | 1774a85b7b6 |
13 | 9711777618 |
14 | 4c83299814 |
15 | 297652269c |
hex | 17913de3ba |
101221000122 has 64 divisors (see below), whose sum is σ = 228260168064. Its totient is φ = 29653827840.
The previous prime is 101221000117. The next prime is 101221000163. The reversal of 101221000122 is 221000122101.
It is a junction number, because it is equal to n+sod(n) for n = 101221000098 and 101221000107.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 251388 + ... + 515400.
It is an arithmetic number, because the mean of its divisors is an integer number (3566565126).
Almost surely, 2101221000122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101221000122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114130084032).
101221000122 is an abundant number, since it is smaller than the sum of its proper divisors (127039167942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101221000122 is a wasteful number, since it uses less digits than its factorization.
101221000122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 264223.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101221000122 its reverse (221000122101), we get a palindrome (322221122223).
It can be divided in two parts, 101 and 221000122, that multiplied together give a palindrome (22321012322).
The spelling of 101221000122 in words is "one hundred one billion, two hundred twenty-one million, one hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •