Base | Representation |
---|---|
bin | 11101011101001011101… |
… | …11000110110101010111 |
3 | 10120202101222201011120100 |
4 | 32232211313012311113 |
5 | 113040240100013421 |
6 | 2052541411305143 |
7 | 133056532031133 |
oct | 16564567066527 |
9 | 3522358634510 |
10 | 1012100001111 |
11 | 360258079911 |
12 | 14419a2ab1b3 |
13 | 74596074504 |
14 | 36db34563c3 |
15 | 1b4d8b8bc26 |
hex | eba5dc6d57 |
1012100001111 has 48 divisors (see below), whose sum is σ = 1571515362144. Its totient is φ = 625410373632.
The previous prime is 1012100001097. The next prime is 1012100001173. The reversal of 1012100001111 is 1111000012101.
It is not a de Polignac number, because 1012100001111 - 215 = 1012099968343 is a prime.
It is a super-3 number, since 3×10121000011113 (a number of 37 digits) contains 333 as substring.
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 = 1012100001093 and 1012100001102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012100001511) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3899875 + ... + 4151291.
It is an arithmetic number, because the mean of its divisors is an integer number (32739903378).
Almost surely, 21012100001111 is an apocalyptic number.
1012100001111 is a deficient number, since it is larger than the sum of its proper divisors (559415361033).
1012100001111 is a wasteful number, since it uses less digits than its factorization.
1012100001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251840 (or 251837 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1012100001111 its reverse (1111000012101), we get a palindrome (2123100013212).
The spelling of 1012100001111 in words is "one trillion, twelve billion, one hundred million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •