Base | Representation |
---|---|
bin | 11101011001011111101… |
… | …10011000110010010011 |
3 | 10120120022000011211020000 |
4 | 32230233312120302103 |
5 | 113022211221213021 |
6 | 2052013123221043 |
7 | 132656501122500 |
oct | 16545766306223 |
9 | 3516260154200 |
10 | 1010120101011 |
11 | 35a43151063a |
12 | 143927217783 |
13 | 7433bb16ba8 |
14 | 36c665104a7 |
15 | 1b41ee49b26 |
hex | eb2fd98c93 |
1010120101011 has 30 divisors (see below), whose sum is σ = 1755303190740. Its totient is φ = 577211484024.
The previous prime is 1010120100971. The next prime is 1010120101069. The reversal of 1010120101011 is 1101010210101.
It is not a de Polignac number, because 1010120101011 - 27 = 1010120100883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1010120100984 and 1010120101002.
It is not an unprimeable number, because it can be changed into a prime (1010120101411) 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 29 ways as a sum of consecutive naturals, for example, 127247241 + ... + 127255178.
It is an arithmetic number, because the mean of its divisors is an integer number (58510106358).
Almost surely, 21010120101011 is an apocalyptic number.
1010120101011 is a deficient number, since it is larger than the sum of its proper divisors (745183089729).
1010120101011 is an equidigital number, since it uses as much as digits as its factorization.
1010120101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254502445 (or 254502429 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1010120101011 its reverse (1101010210101), we get a palindrome (2111130311112).
The spelling of 1010120101011 in words is "one trillion, ten billion, one hundred twenty million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •