Base | Representation |
---|---|
bin | 10011000010011100… |
… | …11001101111100010 |
3 | 222101022210200022100 |
4 | 21201032121233202 |
5 | 131413100200002 |
6 | 4410121351230 |
7 | 511200626241 |
oct | 114116315742 |
9 | 28338720270 |
10 | 10221100002 |
11 | 43755a9793 |
12 | 1b93038516 |
13 | c6b751789 |
14 | 6cd678958 |
15 | 3ec4d411c |
hex | 261399be2 |
10221100002 has 48 divisors (see below), whose sum is σ = 23299049592. Its totient is φ = 3234090240.
The previous prime is 10221099991. The next prime is 10221100013. The reversal of 10221100002 is 20000112201.
10221100002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10221099991) and next prime (10221100013).
It can be written as a sum of positive squares in 4 ways, for example, as 6264564201 + 3956535801 = 79149^2 + 62901^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 159853 + ... + 214464.
Almost surely, 210221100002 is an apocalyptic number.
10221100002 is an abundant number, since it is smaller than the sum of its proper divisors (13077949590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221100002 is a wasteful number, since it uses less digits than its factorization.
10221100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374403 (or 374400 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10221100002 its reverse (20000112201), we get a palindrome (30221212203).
The spelling of 10221100002 in words is "ten billion, two hundred twenty-one million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •