Base | Representation |
---|---|
bin | 101111100110001000… |
… | …0011100100011001000 |
3 | 100202211021020102110212 |
4 | 1133030100130203020 |
5 | 3133312021023422 |
6 | 114542150500252 |
7 | 10245613052405 |
oct | 1371420344310 |
9 | 322737212425 |
10 | 102211111112 |
11 | 3a390564660 |
12 | 17986364688 |
13 | 983b931606 |
14 | 4d389912ac |
15 | 29d33ed9e2 |
hex | 17cc41c8c8 |
102211111112 has 32 divisors (see below), whose sum is σ = 213930240480. Its totient is φ = 45379138560.
The previous prime is 102211111081. The next prime is 102211111133. The reversal of 102211111112 is 211111112201.
102211111112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1022111111122 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13501913 + ... + 13509480.
It is an arithmetic number, because the mean of its divisors is an integer number (6685320015).
Almost surely, 2102211111112 is an apocalyptic number.
It is an amenable number.
102211111112 is an abundant number, since it is smaller than the sum of its proper divisors (111719129368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102211111112 is a wasteful number, since it uses less digits than its factorization.
102211111112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27011453 (or 27011449 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102211111112 its reverse (211111112201), we get a palindrome (313322223313).
It can be divided in two parts, 10 and 2211111112, that added together give a palindrome (2211111122).
The spelling of 102211111112 in words is "one hundred two billion, two hundred eleven million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •