Base | Representation |
---|---|
bin | 10011000010100101… |
… | …01011011100101100 |
3 | 222101101220122011111 |
4 | 21201102223130230 |
5 | 131413342033400 |
6 | 4410201401404 |
7 | 511213305610 |
oct | 114122533454 |
9 | 28341818144 |
10 | 10222221100 |
11 | 43761a5013 |
12 | 1b93499264 |
13 | c6ba54b50 |
14 | 6cd88b340 |
15 | 3ec6563ba |
hex | 2614ab72c |
10222221100 has 144 divisors (see below), whose sum is σ = 27359304448. Its totient is φ = 3228284160.
The previous prime is 10222221067. The next prime is 10222221109. The reversal of 10222221100 is 112222201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (10222221109) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5850427 + ... + 5852173.
Almost surely, 210222221100 is an apocalyptic number.
10222221100 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 10222221100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13679652224).
10222221100 is an abundant number, since it is smaller than the sum of its proper divisors (17137083348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222221100 is a wasteful number, since it uses less digits than its factorization.
10222221100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2424 (or 2417 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10222221100 its reverse (112222201), we get a palindrome (10334443301).
The spelling of 10222221100 in words is "ten billion, two hundred twenty-two million, two hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •