Base | Representation |
---|---|
bin | 110011101111000100… |
… | …1000100011110111010 |
3 | 101121202211022202101000 |
4 | 1213132021010132322 |
5 | 3310013340231020 |
6 | 123012242105430 |
7 | 11012121533253 |
oct | 1473611043672 |
9 | 347684282330 |
10 | 111101102010 |
11 | 43132748378 |
12 | 1964764b276 |
13 | a627675362 |
14 | 553d52bb2a |
15 | 2d53aea090 |
hex | 19de2447ba |
111101102010 has 32 divisors (see below), whose sum is σ = 296269606080. Its totient is φ = 29626960464.
The previous prime is 111101101957. The next prime is 111101102053. The reversal of 111101102010 is 10201101111.
111101102010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 111101101983 and 111101102001.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 205742512 + ... + 205743051.
It is an arithmetic number, because the mean of its divisors is an integer number (9258425190).
Almost surely, 2111101102010 is an apocalyptic number.
111101102010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111101102010 is an abundant number, since it is smaller than the sum of its proper divisors (185168504070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111101102010 is a wasteful number, since it uses less digits than its factorization.
111101102010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 411485579 (or 411485573 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 111101102010 its reverse (10201101111), we get a palindrome (121302203121).
The spelling of 111101102010 in words is "one hundred eleven billion, one hundred one million, one hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •