Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …101100001100101111000 |
3 | 10220011022121001221212000 |
4 | 100000131231201211320 |
5 | 121010310041213422 |
6 | 2201200534021000 |
7 | 142321163404566 |
oct | 20003555414570 |
9 | 3804277057760 |
10 | 1100010101112 |
11 | 39456a03011a |
12 | 1592331a7760 |
13 | 7c965c03b70 |
14 | 3b352976a36 |
15 | 1d9317e8cac |
hex | 1001db61978 |
1100010101112 has 128 divisors (see below), whose sum is σ = 3484195041600. Its totient is φ = 318554947584.
The previous prime is 1100010101087. The next prime is 1100010101149. The reversal of 1100010101112 is 2111010100011.
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 = 1100010101094 and 1100010101103.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 11474073 + ... + 11569544.
Almost surely, 21100010101112 is an apocalyptic number.
1100010101112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1100010101112 is an abundant number, since it is smaller than the sum of its proper divisors (2384184940488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100010101112 is a wasteful number, since it uses less digits than its factorization.
1100010101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23043662 (or 23043652 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1100010101112 its reverse (2111010100011), we get a palindrome (3211020201123).
The spelling of 1100010101112 in words is "one trillion, one hundred billion, ten million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •