Base | Representation |
---|---|
bin | 11101011011001010000… |
… | …01001000101010100010 |
3 | 10120122121011122121220101 |
4 | 32231211001020222202 |
5 | 113031023100023020 |
6 | 2052241430133014 |
7 | 133020552102646 |
oct | 16554501105242 |
9 | 3518534577811 |
10 | 1011012111010 |
11 | 35a849a85990 |
12 | 143b35ab116a |
13 | 74451873865 |
14 | 36d0cb8ac26 |
15 | 1b4733e900a |
hex | eb65048aa2 |
1011012111010 has 16 divisors (see below), whose sum is σ = 1985260145472. Its totient is φ = 367640767600.
The previous prime is 1011012110921. The next prime is 1011012111017. The reversal of 1011012111010 is 101112101101.
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 (1011012111017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4595509486 + ... + 4595509705.
It is an arithmetic number, because the mean of its divisors is an integer number (124078759092).
Almost surely, 21011012111010 is an apocalyptic number.
1011012111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1011012111010 is a deficient number, since it is larger than the sum of its proper divisors (974248034462).
1011012111010 is a wasteful number, since it uses less digits than its factorization.
1011012111010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9191019209.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1011012111010 its reverse (101112101101), we get a palindrome (1112124212111).
Subtracting from 1011012111010 its reverse (101112101101), we obtain a palindrome (909900009909).
The spelling of 1011012111010 in words is "one trillion, eleven billion, twelve million, one hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •