Base | Representation |
---|---|
bin | 10000001001111101101… |
… | …011011011101100101011 |
3 | 10221010122110011120220000 |
4 | 100021331223123230223 |
5 | 121142202241200021 |
6 | 2210005023234043 |
7 | 143132020100655 |
oct | 20117553335453 |
9 | 3833573146800 |
10 | 1110210100011 |
11 | 398923727281 |
12 | 15b1bb148923 |
13 | 80900177c7c |
14 | 3ba3d4bb6d5 |
15 | 1dd2c010b26 |
hex | 1027dadbb2b |
1110210100011 has 20 divisors (see below), whose sum is σ = 1658492913000. Its totient is φ = 740126271456.
The previous prime is 1110210099991. The next prime is 1110210100019. The reversal of 1110210100011 is 1100010120111.
It is not a de Polignac number, because 1110210100011 - 227 = 1110075882283 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1110210099966 and 1110210100002.
It is not an unprimeable number, because it can be changed into a prime (1110210100019) 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 19 ways as a sum of consecutive naturals, for example, 6119160 + ... + 6297978.
It is an arithmetic number, because the mean of its divisors is an integer number (82924645650).
Almost surely, 21110210100011 is an apocalyptic number.
1110210100011 is a deficient number, since it is larger than the sum of its proper divisors (548282812989).
1110210100011 is an equidigital number, since it uses as much as digits as its factorization.
1110210100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255480 (or 255471 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1110210100011 its reverse (1100010120111), we get a palindrome (2210220220122).
The spelling of 1110210100011 in words is "one trillion, one hundred ten billion, two hundred ten million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •