Base | Representation |
---|---|
bin | 11001000011100111110001… |
… | …000110110100011001011011 |
3 | 112110012000111221100212221001 |
4 | 121003213301012310121123 |
5 | 103421004120334310021 |
6 | 1030213105112125431 |
7 | 32132455152200332 |
oct | 3103476106643133 |
9 | 473160457325831 |
10 | 110200021010011 |
11 | 32127625a51539 |
12 | 10439604096877 |
13 | 4964a81a6869a |
14 | 1d2d9d0b30d19 |
15 | cb184e937091 |
hex | 6439f11b465b |
110200021010011 has 4 divisors (see below), whose sum is σ = 110200117458024. Its totient is φ = 110199924562000.
The previous prime is 110200021009987. The next prime is 110200021010117. The reversal of 110200021010011 is 110010120002011.
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 110200021010011 - 29 = 110200021009499 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110200021010011.
It is not an unprimeable number, because it can be changed into a prime (110200021014011) 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, 46489330 + ... + 48802231.
It is an arithmetic number, because the mean of its divisors is an integer number (27550029364506).
Almost surely, 2110200021010011 is an apocalyptic number.
110200021010011 is a deficient number, since it is larger than the sum of its proper divisors (96448013).
110200021010011 is an equidigital number, since it uses as much as digits as its factorization.
110200021010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96448012.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110200021010011 its reverse (110010120002011), we get a palindrome (220210141012022).
The spelling of 110200021010011 in words is "one hundred ten trillion, two hundred billion, twenty-one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •