Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …0000110100111011101000 |
3 | 1022102002120212002002112011 |
4 | 2101202100000310323220 |
5 | 2302324223100013000 |
6 | 33134235241525304 |
7 | 2051361403243303 |
oct | 221422000647350 |
9 | 38362525062464 |
10 | 10001100001000 |
11 | 320649624a059 |
12 | 11563441a3834 |
13 | 57713b0097a4 |
14 | 2680ad26bb3a |
15 | 1252417c92ba |
hex | 91890034ee8 |
10001100001000 has 32 divisors (see below), whose sum is σ = 23402574004680. Its totient is φ = 4000440000000.
The previous prime is 10001100000977. The next prime is 10001100001001. The reversal of 10001100001000 is 10000110001.
It can be written as a sum of positive squares in 4 ways, for example, as 3765222014724 + 6235877986276 = 1940418^2 + 2497174^2 .
It is a Harshad number since it is a multiple of its sum of digits (4).
It is not an unprimeable number, because it can be changed into a prime (10001100001001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5000549001 + ... + 5000551000.
Almost surely, 210001100001000 is an apocalyptic number.
10001100001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10001100001000 is an abundant number, since it is smaller than the sum of its proper divisors (13401474003680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001100001000 is a wasteful number, since it uses less digits than its factorization.
10001100001000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10001100022 (or 10001100008 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 10001100001000 its reverse (10000110001), we get a palindrome (10011100111001).
The spelling of 10001100001000 in words is "ten trillion, one billion, one hundred million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.545 sec. • engine limits •