Base | Representation |
---|---|
bin | 10110101111010110100000… |
… | …001000010001010100010000 |
3 | 111010002221212112202221020111 |
4 | 112233112200020101110100 |
5 | 101102040012000310000 |
6 | 552412230311051104 |
7 | 30031361545526242 |
oct | 2657264010212420 |
9 | 433087775687214 |
10 | 100011000010000 |
11 | 29959477251532 |
12 | b272975670a94 |
13 | 43a5cc6074cc1 |
14 | 1a9a7b5ac6092 |
15 | b867b0361cba |
hex | 5af5a0211510 |
100011000010000 has 50 divisors (see below), whose sum is σ = 242136632148422. Its totient is φ = 40004400000000.
The previous prime is 100011000009983. The next prime is 100011000010043. The reversal of 100011000010000 is 10000110001.
It can be written as a sum of positive squares in 5 ways, for example, as 30814755618816 + 69196244391184 = 5551104^2 + 8318428^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is a Harshad number since it is a multiple of its sum of digits (4).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 5000540001 + ... + 5000560000.
Almost surely, 2100011000010000 is an apocalyptic number.
100011000010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100011000010000 is an abundant number, since it is smaller than the sum of its proper divisors (142125632138422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100011000010000 is an equidigital number, since it uses as much as digits as its factorization.
100011000010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10001100029 (or 10001100008 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 100011000010000 its reverse (10000110001), we get a palindrome (100021000120001).
The spelling of 100011000010000 in words is "one hundred trillion, eleven billion, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •