Base | Representation |
---|---|
bin | 11101001001101110100… |
… | …10110011001010011000 |
3 | 10112202110001200221010101 |
4 | 32210313102303022120 |
5 | 112402342143230000 |
6 | 2044053132025144 |
7 | 132236642326165 |
oct | 16446722631230 |
9 | 3482401627111 |
10 | 1001655055000 |
11 | 356888190246 |
12 | 1421643021b4 |
13 | 735c0139822 |
14 | 366a218d06c |
15 | 1b0c6bdce6a |
hex | e9374b3298 |
1001655055000 has 40 divisors (see below), whose sum is σ = 2346877805580. Its totient is φ = 400662020000.
The previous prime is 1001655054989. The next prime is 1001655055003. The reversal of 1001655055000 is 5505561001.
1001655055000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 1001655055000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001655055003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 100160506 + ... + 100170505.
Almost surely, 21001655055000 is an apocalyptic number.
1001655055000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1001655055000 is an abundant number, since it is smaller than the sum of its proper divisors (1345222750580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001655055000 is an equidigital number, since it uses as much as digits as its factorization.
1001655055000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200331037 (or 200331018 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 1001655055000 in words is "one trillion, one billion, six hundred fifty-five million, fifty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •