Base | Representation |
---|---|
bin | 11101011101001110001… |
… | …11101000100111011001 |
3 | 10120202110110102122220010 |
4 | 32232213013220213121 |
5 | 113040311001023001 |
6 | 2052543443552133 |
7 | 133060206332040 |
oct | 16564707504731 |
9 | 3522413378803 |
10 | 1012121111001 |
11 | 360268a88000 |
12 | 1441a538b649 |
13 | 7459a555b80 |
14 | 36db618d557 |
15 | 1b4da95b8d6 |
hex | eba71e89d9 |
1012121111001 has 128 divisors (see below), whose sum is σ = 1829394911232. Its totient is φ = 484665984000.
The previous prime is 1012121110993. The next prime is 1012121111003. The reversal of 1012121111001 is 1001111212101.
It is not a de Polignac number, because 1012121111001 - 23 = 1012121110993 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1012121111003) 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 127 ways as a sum of consecutive naturals, for example, 355004226 + ... + 355007076.
It is an arithmetic number, because the mean of its divisors is an integer number (14292147744).
Almost surely, 21012121111001 is an apocalyptic number.
1012121111001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012121111001 is a deficient number, since it is larger than the sum of its proper divisors (817273800231).
1012121111001 is a wasteful number, since it uses less digits than its factorization.
1012121111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3884 (or 3862 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1012121111001 its reverse (1001111212101), we get a palindrome (2013232323102).
The spelling of 1012121111001 in words is "one trillion, twelve billion, one hundred twenty-one million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •