Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0111000001110001111010 |
3 | 1102222122121020222000120202 |
4 | 2200032321113001301322 |
5 | 2420401223404014320 |
6 | 35230233510522202 |
7 | 2214345411141005 |
oct | 240167127016172 |
9 | 42878536860522 |
10 | 11011111001210 |
11 | 3565871112641 |
12 | 129a03a966362 |
13 | 61b460344698 |
14 | 2a0d2509c53c |
15 | 141656d72b75 |
hex | a03b95c1c7a |
11011111001210 has 32 divisors (see below), whose sum is σ = 19945336320000. Its totient is φ = 4376630508480.
The previous prime is 11011111001173. The next prime is 11011111001213. The reversal of 11011111001210 is 1210011111011.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11011111001191 and 11011111001200.
It is not an unprimeable number, because it can be changed into a prime (11011111001213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 137210 + ... + 4694789.
It is an arithmetic number, because the mean of its divisors is an integer number (623291760000).
Almost surely, 211011111001210 is an apocalyptic number.
11011111001210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011111001210 is a deficient number, since it is larger than the sum of its proper divisors (8934225318790).
11011111001210 is a wasteful number, since it uses less digits than its factorization.
11011111001210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4833446.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11011111001210 its reverse (1210011111011), we get a palindrome (12221122112221).
The spelling of 11011111001210 in words is "eleven trillion, eleven billion, one hundred eleven million, one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •