Base | Representation |
---|---|
bin | 10110101111010110100110… |
… | …000110001000010010000001 |
3 | 111010002222010112010122101000 |
4 | 112233112212012020102001 |
5 | 101102040213112041001 |
6 | 552412244244402213 |
7 | 30031364202424641 |
oct | 2657264606102201 |
9 | 433088115118330 |
10 | 100011100112001 |
11 | 29959518802661 |
12 | b2729a30a6369 |
13 | 43a6010a23060 |
14 | 1a9a7c5102521 |
15 | b867b9036a86 |
hex | 5af5a6188481 |
100011100112001 has 128 divisors (see below), whose sum is σ = 162126147456000. Its totient is φ = 60559758120960.
The previous prime is 100011100111999. The next prime is 100011100112039. The reversal of 100011100112001 is 100211001110001.
It is not a de Polignac number, because 100011100112001 - 21 = 100011100111999 is a prime.
It is a super-2 number, since 2×1000111001120012 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (100011100112041) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 51314057575 + ... + 51314059523.
It is an arithmetic number, because the mean of its divisors is an integer number (1266610527000).
Almost surely, 2100011100112001 is an apocalyptic number.
It is an amenable number.
100011100112001 is a deficient number, since it is larger than the sum of its proper divisors (62115047343999).
100011100112001 is a wasteful number, since it uses less digits than its factorization.
100011100112001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5016 (or 5010 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100011100112001 its reverse (100211001110001), we get a palindrome (200222101222002).
The spelling of 100011100112001 in words is "one hundred trillion, eleven billion, one hundred million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •