Base | Representation |
---|---|
bin | 11101011001010001100… |
… | …00011110011111100000 |
3 | 10120112222201021111121212 |
4 | 32230220300132133200 |
5 | 113021440241023013 |
6 | 2051553233005252 |
7 | 132653524536041 |
oct | 16545060363740 |
9 | 3515881244555 |
10 | 1010001111008 |
11 | 35a38032969a |
12 | 1438b33b3828 |
13 | 743202848c6 |
14 | 36c547b88c8 |
15 | 1b4147936a8 |
hex | eb28c1e7e0 |
1010001111008 has 48 divisors (see below), whose sum is σ = 2031478989120. Its totient is φ = 494121878016.
The previous prime is 1010001111001. The next prime is 1010001111013. The reversal of 1010001111008 is 8001111000101.
It is a happy number.
1010001111008 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 1010001110983 and 1010001111001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010001111001) 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, 188903 + ... + 1433766.
It is an arithmetic number, because the mean of its divisors is an integer number (42322478940).
Almost surely, 21010001111008 is an apocalyptic number.
It is an amenable number.
1010001111008 is an abundant number, since it is smaller than the sum of its proper divisors (1021477878112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010001111008 is a wasteful number, since it uses less digits than its factorization.
1010001111008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1623099 (or 1623091 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1010001111008 its reverse (8001111000101), we get a palindrome (9011112111109).
The spelling of 1010001111008 in words is "one trillion, ten billion, one million, one hundred eleven thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •