Base | Representation |
---|---|
bin | 10111001111010110100101… |
… | …011011100100100001000011 |
3 | 111101220012011110100121102221 |
4 | 113033112211123210201003 |
5 | 101344102302211223021 |
6 | 1001214402145351511 |
7 | 30346302602030140 |
oct | 2717264533444103 |
9 | 441805143317387 |
10 | 102210112211011 |
11 | 2a627079804a42 |
12 | b569007938597 |
13 | 45054aba1449c |
14 | 1b34dd27953c7 |
15 | bc3abd897241 |
hex | 5cf5a56e4843 |
102210112211011 has 8 divisors (see below), whose sum is σ = 116811779491584. Its totient is φ = 87608500600200.
The previous prime is 102210112210907. The next prime is 102210112211029. The reversal of 102210112211011 is 110112211012201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102210112211011 - 239 = 101660356397123 is a prime.
It is a super-3 number, since 3×1022101122110113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102210112211041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9906055 + ... + 17393968.
It is an arithmetic number, because the mean of its divisors is an integer number (14601472436448).
Almost surely, 2102210112211011 is an apocalyptic number.
102210112211011 is a deficient number, since it is larger than the sum of its proper divisors (14601667280573).
102210112211011 is an equidigital number, since it uses as much as digits as its factorization.
102210112211011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27834881.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 102210112211011 its reverse (110112211012201), we get a palindrome (212322323223212).
The spelling of 102210112211011 in words is "one hundred two trillion, two hundred ten billion, one hundred twelve million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •