Base | Representation |
---|---|
bin | 1010100000010111000010… |
… | …01000000011000011000010 |
3 | 10000210112120211210011200000 |
4 | 11100023201020003003002 |
5 | 11012001110420213442 |
6 | 121044544024540430 |
7 | 4603033564225164 |
oct | 520134110030302 |
9 | 100715524704600 |
10 | 23102111101122 |
11 | 73a760649a389 |
12 | 2711416321716 |
13 | cb769aaca021 |
14 | 59c210710934 |
15 | 2a0e13d20d4c |
hex | 1502e12030c2 |
23102111101122 has 48 divisors (see below), whose sum is σ = 52443585903072. Its totient is φ = 7621314986880.
The previous prime is 23102111101117. The next prime is 23102111101163. The reversal of 23102111101122 is 22110111120132.
It is a happy number.
23102111101122 is a `hidden beast` number, since 2 + 310 + 211 + 110 + 11 + 22 = 666.
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 = 23102111101095 and 23102111101104.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 244979704 + ... + 245073987.
It is an arithmetic number, because the mean of its divisors is an integer number (1092574706314).
Almost surely, 223102111101122 is an apocalyptic number.
23102111101122 is an abundant number, since it is smaller than the sum of its proper divisors (29341474801950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23102111101122 is an equidigital number, since it uses as much as digits as its factorization.
23102111101122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 490053805 (or 490053793 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 23102111101122 its reverse (22110111120132), we get a palindrome (45212222221254).
The spelling of 23102111101122 in words is "twenty-three trillion, one hundred two billion, one hundred eleven million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •