Base | Representation |
---|---|
bin | 1001000110101110010101… |
… | …0100010100101111111010 |
3 | 1022110001110020120011202201 |
4 | 2101223211110110233322 |
5 | 2303010234001010020 |
6 | 33143013501020414 |
7 | 2052164625253456 |
oct | 221534524245772 |
9 | 38401406504681 |
10 | 10011121110010 |
11 | 320a768971629 |
12 | 115828025470a |
13 | 5780771a80a7 |
14 | 268780127666 |
15 | 12562b456a0a |
hex | 91ae5514bfa |
10011121110010 has 64 divisors (see below), whose sum is σ = 18537443495424. Its totient is φ = 3890304806400.
The previous prime is 10011121109999. The next prime is 10011121110019. The reversal of 10011121110010 is 1001112111001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (10011121110019) 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 31 ways as a sum of consecutive naturals, for example, 219197197 + ... + 219242863.
It is an arithmetic number, because the mean of its divisors is an integer number (289647554616).
Almost surely, 210011121110010 is an apocalyptic number.
10011121110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10011121110010 is a deficient number, since it is larger than the sum of its proper divisors (8526322385414).
10011121110010 is a wasteful number, since it uses less digits than its factorization.
10011121110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47959.
The product of its (nonzero) digits is 2, while the sum is 10.
10011121110010 divided by its sum of digits (10) gives a palindrome (1001112111001).
Adding to 10011121110010 its reverse (1001112111001), we get a palindrome (11012233221011).
The spelling of 10011121110010 in words is "ten trillion, eleven billion, one hundred twenty-one million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •