Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …001100000001100011100000 |
3 | 111020121111122201210211200111 |
4 | 112331233211030001203200 |
5 | 101214241000240200000 |
6 | 554450432052501104 |
7 | 30163003116222262 |
oct | 2675574514014340 |
9 | 436544581724614 |
10 | 101000001100000 |
11 | 2a1aa950613562 |
12 | b3b258801a794 |
13 | 444834a708372 |
14 | 1ad25d7463b32 |
15 | ba23961a1cba |
hex | 5bdbe53018e0 |
101000001100000 has 72 divisors (see below), whose sum is σ = 248538782952936. Its totient is φ = 40400000400000.
The previous prime is 101000001099971. The next prime is 101000001100069. The reversal of 101000001100000 is 1100000101.
It is a Harshad number since it is a multiple of its sum of digits (4).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 504900006 + ... + 505100005.
It is an arithmetic number, because the mean of its divisors is an integer number (3451927541013).
Almost surely, 2101000001100000 is an apocalyptic number.
101000001100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101000001100000 is an abundant number, since it is smaller than the sum of its proper divisors (147538781852936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101000001100000 is an frugal number, since it uses more digits than its factorization.
101000001100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010000046 (or 1010000018 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 101000001100000 its reverse (1100000101), we get a palindrome (101001101100101).
The spelling of 101000001100000 in words is "one hundred one trillion, one million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •