Base | Representation |
---|---|
bin | 10111001101111010010011… |
… | …001101100110011011001000 |
3 | 111101112201101201020010211101 |
4 | 113031322103031212123020 |
5 | 101340441333202423422 |
6 | 1001101053413111144 |
7 | 30336164215544533 |
oct | 2715722315463310 |
9 | 441481351203741 |
10 | 102111022311112 |
11 | 2a59905007a591 |
12 | b5519729284b4 |
13 | 44c9049926719 |
14 | 1b302b255da1a |
15 | bc121e4d1c27 |
hex | 5cde933666c8 |
102111022311112 has 16 divisors (see below), whose sum is σ = 191525321617200. Its totient is φ = 51037603213200.
The previous prime is 102111022311101. The next prime is 102111022311113. The reversal of 102111022311112 is 211113220111201.
It is a self number, because there is not a number n which added to its sum of digits gives 102111022311112.
It is not an unprimeable number, because it can be changed into a prime (102111022311113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2238468562 + ... + 2238514177.
It is an arithmetic number, because the mean of its divisors is an integer number (11970332601075).
Almost surely, 2102111022311112 is an apocalyptic number.
It is an amenable number.
102111022311112 is a deficient number, since it is larger than the sum of its proper divisors (89414299306088).
102111022311112 is a wasteful number, since it uses less digits than its factorization.
102111022311112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4476985596 (or 4476985592 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 102111022311112 its reverse (211113220111201), we get a palindrome (313224242422313).
The spelling of 102111022311112 in words is "one hundred two trillion, one hundred eleven billion, twenty-two million, three hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •