| Base | Representation |
|---|---|
| bin | 11101011001010010101… |
| … | …10100101011101001000 |
| 3 | 10120120000102002001022120 |
| 4 | 32230221112211131020 |
| 5 | 113022000320213000 |
| 6 | 2051554231051240 |
| 7 | 132654005464266 |
| oct | 16545126453510 |
| 9 | 3516012061276 |
| 10 | 1010011101000 |
| 11 | 35a385a32290 |
| 12 | 1438b6810b20 |
| 13 | 74322371a45 |
| 14 | 36c55c59436 |
| 15 | 1b4155b86a0 |
| hex | eb295a5748 |
1010011101000 has 512 divisors, whose sum is σ = 3743490816000. Its totient is φ = 223961472000.
The previous prime is 1010011100999. The next prime is 1010011101007. The reversal of 1010011101000 is 1011100101.
1010011101000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 1010011101000.
It is not an unprimeable number, because it can be changed into a prime (1010011101007) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 18155227 + ... + 18210773.
It is an arithmetic number, because the mean of its divisors is an integer number (7311505500).
Almost surely, 21010011101000 is an apocalyptic number.
1010011101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1010011101000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1871745408000).
1010011101000 is an abundant number, since it is smaller than the sum of its proper divisors (2733479715000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010011101000 is a wasteful number, since it uses less digits than its factorization.
1010011101000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55630 (or 55616 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1010011101000 its reverse (1011100101), we get a palindrome (1011022201101).
The spelling of 1010011101000 in words is "one trillion, ten billion, eleven million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •