Base | Representation |
---|---|
bin | 10011000010100101… |
… | …11110101101101011 |
3 | 222101102001122102010 |
4 | 21201102332231223 |
5 | 131413402100021 |
6 | 4410203211003 |
7 | 511214054640 |
oct | 114122765553 |
9 | 28342048363 |
10 | 10222300011 |
11 | 4376249330 |
12 | 1b93516a63 |
13 | c6ba81a41 |
14 | 6cd8abdc7 |
15 | 3ec66e976 |
hex | 2614beb6b |
10222300011 has 64 divisors (see below), whose sum is σ = 17336033280. Its totient is φ = 5204010240.
The previous prime is 10222300007. The next prime is 10222300061. The reversal of 10222300011 is 11000322201.
10222300011 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10222300011 - 22 = 10222300007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10222300011.
It is not an unprimeable number, because it can be changed into a prime (10222300061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2746810 + ... + 2750528.
It is an arithmetic number, because the mean of its divisors is an integer number (270875520).
Almost surely, 210222300011 is an apocalyptic number.
10222300011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10222300011 is a deficient number, since it is larger than the sum of its proper divisors (7113733269).
10222300011 is a wasteful number, since it uses less digits than its factorization.
10222300011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3976.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10222300011 its reverse (11000322201), we get a palindrome (21222622212).
The spelling of 10222300011 in words is "ten billion, two hundred twenty-two million, three hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •