Base | Representation |
---|---|
bin | 1001001100100011001110… |
… | …1111001001011011111110 |
3 | 1022210121211101012002002100 |
4 | 2103020303233021123332 |
5 | 2311130240034342342 |
6 | 33301010353205530 |
7 | 2062340324346201 |
oct | 223106357113376 |
9 | 38717741162070 |
10 | 10111221012222 |
11 | 3249165731740 |
12 | 11737575608a6 |
13 | 58463a5c5965 |
14 | 26d558551938 |
15 | 128039326e4c |
hex | 93233bc96fe |
10111221012222 has 24 divisors (see below), whose sum is σ = 23899249665720. Its totient is φ = 3064006367280.
The previous prime is 10111221012131. The next prime is 10111221012223. The reversal of 10111221012222 is 22221012211101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10111221012195 and 10111221012204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111221012223) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25533386197 + ... + 25533386592.
It is an arithmetic number, because the mean of its divisors is an integer number (995802069405).
Almost surely, 210111221012222 is an apocalyptic number.
10111221012222 is an abundant number, since it is smaller than the sum of its proper divisors (13788028653498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111221012222 is a wasteful number, since it uses less digits than its factorization.
10111221012222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51066772808 (or 51066772805 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 10111221012222 its reverse (22221012211101), we get a palindrome (32332233223323).
The spelling of 10111221012222 in words is "ten trillion, one hundred eleven billion, two hundred twenty-one million, twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •