Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …0011011111000110011100 |
3 | 1022102221120011220020220220 |
4 | 2101222202203133012130 |
5 | 2303000440224323400 |
6 | 33142310405241340 |
7 | 2052125104500126 |
oct | 221524243370634 |
9 | 38387504806826 |
10 | 10010001011100 |
11 | 320a243679752 |
12 | 1158009103250 |
13 | 577c2910ac7c |
14 | 2686b5476216 |
15 | 1255b2e507a0 |
hex | 91aa28df19c |
10010001011100 has 36 divisors (see below), whose sum is σ = 28962269592984. Its totient is φ = 2669333602880.
The previous prime is 10010001011081. The next prime is 10010001011149. The reversal of 10010001011100 is 111010001001.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16683334719 + ... + 16683335318.
It is an arithmetic number, because the mean of its divisors is an integer number (804507488694).
Almost surely, 210010001011100 is an apocalyptic number.
10010001011100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10010001011100 is an abundant number, since it is smaller than the sum of its proper divisors (18952268581884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010001011100 is a wasteful number, since it uses less digits than its factorization.
10010001011100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33366670054 (or 33366670047 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10010001011100 its reverse (111010001001), we get a palindrome (10121011012101).
The spelling of 10010001011100 in words is "ten trillion, ten billion, one million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •