Base | Representation |
---|---|
bin | 10011000010100100… |
… | …01110010111110000 |
3 | 222101101200120210101 |
4 | 21201102032113300 |
5 | 131413324231000 |
6 | 4410155042144 |
7 | 511212301435 |
oct | 114122162760 |
9 | 28341616711 |
10 | 10222102000 |
11 | 4376123590 |
12 | 1b93440354 |
13 | c6ba12886 |
14 | 6cd859b8c |
15 | 3ec630e6a |
hex | 26148e5f0 |
10222102000 has 160 divisors (see below), whose sum is σ = 27095140800. Its totient is φ = 3699072000.
The previous prime is 10222101979. The next prime is 10222102019. The reversal of 10222102000 is 20122201.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
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, 5036986 + ... + 5039014.
It is an arithmetic number, because the mean of its divisors is an integer number (169344630).
Almost surely, 210222102000 is an apocalyptic number.
10222102000 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 10222102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13547570400).
10222102000 is an abundant number, since it is smaller than the sum of its proper divisors (16873038800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222102000 is a wasteful number, since it uses less digits than its factorization.
10222102000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2292 (or 2276 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 10222102000 its reverse (20122201), we get a palindrome (10242224201).
The spelling of 10222102000 in words is "ten billion, two hundred twenty-two million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •