Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …101001001001001101000 |
3 | 10220011022120212212112011 |
4 | 100000131231021021220 |
5 | 121010310030013000 |
6 | 2201200531525304 |
7 | 142321162506661 |
oct | 20003555111150 |
9 | 3804276785464 |
10 | 1100010001000 |
11 | 394569a71989 |
12 | 159233159834 |
13 | 7c965b9a421 |
14 | 3b35294c368 |
15 | 1d9317c92ba |
hex | 1001db49268 |
1100010001000 has 32 divisors (see below), whose sum is σ = 2574023404680. Its totient is φ = 440004000000.
The previous prime is 1100010000989. The next prime is 1100010001001. The reversal of 1100010001000 is 1000100011.
It can be written as a sum of positive squares in 4 ways, for example, as 51257865604 + 1048752135396 = 226402^2 + 1024086^2 .
It is a Harshad number since it is a multiple of its sum of digits (4).
1100010001000 is a modest number, since divided by 10001000 gives 11000 as remainder.
It is not an unprimeable number, because it can be changed into a prime (1100010001001) 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, 550004001 + ... + 550006000.
Almost surely, 21100010001000 is an apocalyptic number.
1100010001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100010001000 is an abundant number, since it is smaller than the sum of its proper divisors (1474013403680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100010001000 is a wasteful number, since it uses less digits than its factorization.
1100010001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100010022 (or 1100010008 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 1100010001000 its reverse (1000100011), we get a palindrome (1101010101011).
The spelling of 1100010001000 in words is "one trillion, one hundred billion, ten million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •