Base | Representation |
---|---|
bin | 1010000110001010111001… |
… | …0111111101110101000010 |
3 | 1110022020221012200021120102 |
4 | 2201202232113331311002 |
5 | 2423340043434323020 |
6 | 35335441245442402 |
7 | 2224013061454442 |
oct | 241425627756502 |
9 | 43266835607512 |
10 | 11101121011010 |
11 | 359aa60450198 |
12 | 12b357ab70402 |
13 | 626aa625cb04 |
14 | 2a5423444122 |
15 | 143b7402a475 |
hex | a18ae5fdd42 |
11101121011010 has 32 divisors (see below), whose sum is σ = 20165844283200. Its totient is φ = 4399600121280.
The previous prime is 11101121010997. The next prime is 11101121011067. The reversal of 11101121011010 is 1011012110111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11101121010982 and 11101121011000.
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 15 ways as a sum of consecutive naturals, for example, 53885981 + ... + 54091599.
It is an arithmetic number, because the mean of its divisors is an integer number (630182633850).
Almost surely, 211101121011010 is an apocalyptic number.
11101121011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11101121011010 is a deficient number, since it is larger than the sum of its proper divisors (9064723272190).
11101121011010 is a wasteful number, since it uses less digits than its factorization.
11101121011010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255266.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11101121011010 its reverse (1011012110111), we get a palindrome (12112133121121).
The spelling of 11101121011010 in words is "eleven trillion, one hundred one billion, one hundred twenty-one million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •