Base | Representation |
---|---|
bin | 101111001000101010… |
… | …0100111110010110000 |
3 | 100200021100201011012221 |
4 | 1132101110213302300 |
5 | 3124300410200000 |
6 | 114300110130424 |
7 | 10212245531062 |
oct | 1362124476260 |
9 | 320240634187 |
10 | 101222350000 |
11 | 39a23417812 |
12 | 1774b1b0a14 |
13 | 9711b2ab75 |
14 | 4c8352b732 |
15 | 29766dc61a |
hex | 1791527cb0 |
101222350000 has 120 divisors (see below), whose sum is σ = 245646683856. Its totient is φ = 40404000000.
The previous prime is 101222349989. The next prime is 101222350001. The reversal of 101222350000 is 53222101.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (101222350001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27348150 + ... + 27351850.
Almost surely, 2101222350000 is an apocalyptic number.
101222350000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101222350000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122823341928).
101222350000 is an abundant number, since it is smaller than the sum of its proper divisors (144424333856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101222350000 is an frugal number, since it uses more digits than its factorization.
101222350000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4281 (or 4255 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
Adding to 101222350000 its reverse (53222101), we get a palindrome (101275572101).
The spelling of 101222350000 in words is "one hundred one billion, two hundred twenty-two million, three hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.208 sec. • engine limits •