Base | Representation |
---|---|
bin | 10100100010000110110… |
… | …000010111101110001110 |
3 | 11222220001201102211110102 |
4 | 110202012300113232032 |
5 | 141104222041200420 |
6 | 3000113055211102 |
7 | 203641100650202 |
oct | 24420660275616 |
9 | 4886051384412 |
10 | 1411010100110 |
11 | 4a4451464486 |
12 | 1a9568516a92 |
13 | a3099959800 |
14 | 4c416988b02 |
15 | 26a84a46a75 |
hex | 14886c17b8e |
1411010100110 has 48 divisors (see below), whose sum is σ = 2775449033280. Its totient is φ = 516208567680.
The previous prime is 1411010100053. The next prime is 1411010100151. The reversal of 1411010100110 is 110010101141.
It is a happy number.
It is a super-2 number, since 2×14110101001102 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1411010100091 and 1411010100100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3645686 + ... + 4014105.
It is an arithmetic number, because the mean of its divisors is an integer number (57821854860).
Almost surely, 21411010100110 is an apocalyptic number.
1411010100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1411010100110 is a deficient number, since it is larger than the sum of its proper divisors (1364438933170).
1411010100110 is a wasteful number, since it uses less digits than its factorization.
1411010100110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7659933 (or 7659920 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1411010100110 its reverse (110010101141), we get a palindrome (1521020201251).
The spelling of 1411010100110 in words is "one trillion, four hundred eleven billion, ten million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •