Base | Representation |
---|---|
bin | 1001001100100110100000… |
… | …1000100111000001000011 |
3 | 1022210201002122100110211211 |
4 | 2103021220020213001003 |
5 | 2311134040111232321 |
6 | 33301233515150551 |
7 | 2062401160445602 |
oct | 223115010470103 |
9 | 38721078313754 |
10 | 10112100102211 |
11 | 3249576981a98 |
12 | 1173961a45457 |
13 | 58474a77a953 |
14 | 26d5dd1c7a39 |
15 | 12808b5c30e1 |
hex | 93268227043 |
10112100102211 has 4 divisors (see below), whose sum is σ = 10179966546000. Its totient is φ = 10044233658424.
The previous prime is 10112100102179. The next prime is 10112100102241. The reversal of 10112100102211 is 11220100121101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10112100102211 - 25 = 10112100102179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10112100102191 and 10112100102200.
It is not an unprimeable number, because it can be changed into a prime (10112100102241) 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, 33933221671 + ... + 33933221968.
It is an arithmetic number, because the mean of its divisors is an integer number (2544991636500).
Almost surely, 210112100102211 is an apocalyptic number.
10112100102211 is a deficient number, since it is larger than the sum of its proper divisors (67866443789).
10112100102211 is an equidigital number, since it uses as much as digits as its factorization.
10112100102211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67866443788.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10112100102211 its reverse (11220100121101), we get a palindrome (21332200223312).
The spelling of 10112100102211 in words is "ten trillion, one hundred twelve billion, one hundred million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •