Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …0111100111000101000000 |
3 | 1022110001101211201111000112 |
4 | 2101223210013213011000 |
5 | 2303010213324000000 |
6 | 33143011502010452 |
7 | 2052164262315632 |
oct | 221534407470500 |
9 | 38401354644015 |
10 | 10011101000000 |
11 | 320a758586691 |
12 | 1158275576a28 |
13 | 578072c86889 |
14 | 26877b5b0a52 |
15 | 1256297d3235 |
hex | 91ae41e7140 |
10011101000000 has 98 divisors (see below), whose sum is σ = 24831907811574. Its totient is φ = 4004440000000.
The previous prime is 10011100999997. The next prime is 10011101000009. The reversal of 10011101000000 is 10111001.
It can be written as a sum of positive squares in 7 ways, for example, as 9481571174656 + 529529825344 = 3079216^2 + 727688^2 .
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011101000009) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 4005551 + ... + 6005550.
Almost surely, 210011101000000 is an apocalyptic number.
10011101000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10011101000000 is an abundant number, since it is smaller than the sum of its proper divisors (14820806811574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011101000000 is an frugal number, since it uses more digits than its factorization.
10011101000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10011143 (or 10011108 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10011101000000 its reverse (10111001), we get a palindrome (10011111111001).
The spelling of 10011101000000 in words is "ten trillion, eleven billion, one hundred one million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •