Base | Representation |
---|---|
bin | 10111001101111010011000… |
… | …100001000110111110000001 |
3 | 111101112201121220200211001011 |
4 | 113031322120201012332001 |
5 | 101340442023443424413 |
6 | 1001101110312440521 |
7 | 30336166346204233 |
oct | 2715723041067601 |
9 | 441481556624034 |
10 | 102111111311233 |
11 | 2a599096338702 |
12 | b5519986a9141 |
13 | 44c90621b850b |
14 | 1b302c02ca253 |
15 | bc122721233d |
hex | 5cde98846f81 |
102111111311233 has 16 divisors (see below), whose sum is σ = 106877757772800. Its totient is φ = 97372117085760.
The previous prime is 102111111311219. The next prime is 102111111311263. The reversal of 102111111311233 is 332113111111201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 102111111311233 - 229 = 102110574440321 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102111111311263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6709423 + ... + 15787291.
It is an arithmetic number, because the mean of its divisors is an integer number (6679859860800).
Almost surely, 2102111111311233 is an apocalyptic number.
It is an amenable number.
102111111311233 is a deficient number, since it is larger than the sum of its proper divisors (4766646461567).
102111111311233 is a wasteful number, since it uses less digits than its factorization.
102111111311233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9079392.
The product of its (nonzero) digits is 108, while the sum is 22.
Adding to 102111111311233 its reverse (332113111111201), we get a palindrome (434224222422434).
The spelling of 102111111311233 in words is "one hundred two trillion, one hundred eleven billion, one hundred eleven million, three hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •