Base | Representation |
---|---|
bin | 11101000110110101001… |
… | …10101111010011101000 |
3 | 10112121102200121000001210 |
4 | 32203122212233103220 |
5 | 112341201100013000 |
6 | 2043234541513120 |
7 | 132153260514102 |
oct | 16433246572350 |
9 | 3477380530053 |
10 | 1000100001000 |
11 | 35615a418151 |
12 | 1419ab5727a0 |
13 | 73402c0c929 |
14 | 36595838572 |
15 | 1b03541b350 |
hex | e8da9af4e8 |
1000100001000 has 128 divisors (see below), whose sum is σ = 3120731452800. Its totient is φ = 266657484800.
The previous prime is 1000100000929. The next prime is 1000100001011. The reversal of 1000100001000 is 1000010001.
It is a Harshad number since it is a multiple of its sum of digits (3).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28239304 + ... + 28274696.
It is an arithmetic number, because the mean of its divisors is an integer number (24380714475).
Almost surely, 21000100001000 is an apocalyptic number.
1000100001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1000100001000 is an abundant number, since it is smaller than the sum of its proper divisors (2120631451800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000100001000 is a wasteful number, since it uses less digits than its factorization.
1000100001000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44836 (or 44822 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 3.
Adding to 1000100001000 its reverse (1000010001), we get a palindrome (1001100011001).
Subtracting from 1000100001000 its reverse (1000010001), we obtain a palindrome (999099990999).
The spelling of 1000100001000 in words is "one trillion, one hundred million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •