Base | Representation |
---|---|
bin | 101111000101000010… |
… | …1101101010101000101 |
3 | 100122221220100221022200 |
4 | 1132022011231111011 |
5 | 3124023324000010 |
6 | 114240053145113 |
7 | 10206243215025 |
oct | 1361205552505 |
9 | 318856327280 |
10 | 101101000005 |
11 | 39970973765 |
12 | 1771662b199 |
13 | 96c2950635 |
14 | 4c7137da85 |
15 | 296ac1bcc0 |
hex | 178a16d545 |
101101000005 has 24 divisors (see below), whose sum is σ = 175268172768. Its totient is φ = 53912398176.
The previous prime is 101101000003. The next prime is 101101000127. The reversal of 101101000005 is 500000101101.
It is not a de Polignac number, because 101101000005 - 21 = 101101000003 is a prime.
It is a super-2 number, since 2×1011010000052 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101000001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 138234 + ... + 470436.
It is an arithmetic number, because the mean of its divisors is an integer number (7302840532).
Almost surely, 2101101000005 is an apocalyptic number.
101101000005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101101000005 is a deficient number, since it is larger than the sum of its proper divisors (74167172763).
101101000005 is a wasteful number, since it uses less digits than its factorization.
101101000005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 338977 (or 338974 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
Adding to 101101000005 its reverse (500000101101), we get a palindrome (601101101106).
The spelling of 101101000005 in words is "one hundred one billion, one hundred one million, five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •