Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …0100101011010001010000 |
3 | 1022102002120220222100121112 |
4 | 2101202100010223101100 |
5 | 2302324223324310000 |
6 | 33134235315312452 |
7 | 2051361414645062 |
oct | 221422004532120 |
9 | 38362526870545 |
10 | 10001101010000 |
11 | 3206496879141 |
12 | 11563445ab728 |
13 | 57713b2a0b29 |
14 | 2680ad451732 |
15 | 125241928235 |
hex | 9189012b450 |
10001101010000 has 50 divisors (see below), whose sum is σ = 24213665679522. Its totient is φ = 4000440400000.
The previous prime is 10001101009967. The next prime is 10001101010023. The reversal of 10001101010000 is 1010110001.
It can be written as a sum of positive squares in 5 ways, for example, as 1540309352464 + 8460791657536 = 1241092^2 + 2908744^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 (5).
It is a congruent number.
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, 500045051 + ... + 500065050.
Almost surely, 210001101010000 is an apocalyptic number.
10001101010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10001101010000 is an abundant number, since it is smaller than the sum of its proper divisors (14212564669522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001101010000 is an equidigital number, since it uses as much as digits as its factorization.
10001101010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1000110129 (or 1000110108 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10001101010000 its reverse (1010110001), we get a palindrome (10002111120001).
The spelling of 10001101010000 in words is "ten trillion, one billion, one hundred one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •