Base | Representation |
---|---|
bin | 10011000001010000… |
… | …10000100111000010 |
3 | 222100121222200102110 |
4 | 21200220100213002 |
5 | 131403020213442 |
6 | 4405123200150 |
7 | 511016633055 |
oct | 114050204702 |
9 | 28317880373 |
10 | 10211101122 |
11 | 436a99a452 |
12 | 1b8b816056 |
13 | c69660591 |
14 | 6cc1d4a9c |
15 | 3eb6ab69c |
hex | 260a109c2 |
10211101122 has 32 divisors (see below), whose sum is σ = 20980698624. Its totient is φ = 3310675200.
The previous prime is 10211101099. The next prime is 10211101123. The reversal of 10211101122 is 22110111201.
10211101122 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102111011222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10211101098 and 10211101107.
It is not an unprimeable number, because it can be changed into a prime (10211101123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1067722 + ... + 1077242.
It is an arithmetic number, because the mean of its divisors is an integer number (655646832).
Almost surely, 210211101122 is an apocalyptic number.
10211101122 is an abundant number, since it is smaller than the sum of its proper divisors (10769597502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10211101122 is a wasteful number, since it uses less digits than its factorization.
10211101122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14394.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10211101122 its reverse (22110111201), we get a palindrome (32321212323).
The spelling of 10211101122 in words is "ten billion, two hundred eleven million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •