Base | Representation |
---|---|
bin | 1010000000111011111010… |
… | …1111001001011010011010 |
3 | 1102222122211112201002210102 |
4 | 2200032332233021122122 |
5 | 2420401420002210020 |
6 | 35230250452215402 |
7 | 2214350554663301 |
oct | 240167657113232 |
9 | 42878745632712 |
10 | 11011201210010 |
11 | 3565908026871 |
12 | 129a06500a562 |
13 | 61b475c3a681 |
14 | 2a0d33061438 |
15 | 14165ec41475 |
hex | a03bebc969a |
11011201210010 has 64 divisors (see below), whose sum is σ = 21008689113600. Its totient is φ = 4155200683200.
The previous prime is 11011201209979. The next prime is 11011201210043. The reversal of 11011201210010 is 1001210211011.
It is a junction number, because it is equal to n+sod(n) for n = 11011201209973 and 11011201210000.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 16057160 + ... + 16728860.
It is an arithmetic number, because the mean of its divisors is an integer number (328260767400).
Almost surely, 211011201210010 is an apocalyptic number.
11011201210010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011201210010 is a deficient number, since it is larger than the sum of its proper divisors (9997487903590).
11011201210010 is an equidigital number, since it uses as much as digits as its factorization.
11011201210010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672004 (or 671966 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11011201210010 its reverse (1001210211011), we get a palindrome (12012411421021).
The spelling of 11011201210010 in words is "eleven trillion, eleven billion, two hundred one million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •