Base | Representation |
---|---|
bin | 101111110000000011001010… |
… | …100110100001010111101000 |
3 | 1000112120202211100102121221122 |
4 | 233300003022212201113220 |
5 | 210011301211210013000 |
6 | 2022353152305154412 |
7 | 62143505356401164 |
oct | 5760031246412750 |
9 | 1015522740377848 |
10 | 210010120001000 |
11 | 60a08878873960 |
12 | 1b67945032ba08 |
13 | 9024b3bc2c077 |
14 | 39c0788bd1ca4 |
15 | 1942ca2696085 |
hex | bf00ca9a15e8 |
210010120001000 has 128 divisors (see below), whose sum is σ = 544100033842560. Its totient is φ = 75227505408000.
The previous prime is 210010120000981. The next prime is 210010120001009. The reversal of 210010120001000 is 100021010012.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (210010120001009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 141739337 + ... + 143213336.
It is an arithmetic number, because the mean of its divisors is an integer number (4250781514395).
Almost surely, 2210010120001000 is an apocalyptic number.
210010120001000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210010120001000 is an abundant number, since it is smaller than the sum of its proper divisors (334089913841560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210010120001000 is a wasteful number, since it uses less digits than its factorization.
210010120001000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 284952772 (or 284952758 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 210010120001000 its reverse (100021010012), we get a palindrome (210110141011012).
The spelling of 210010120001000 in words is "two hundred ten trillion, ten billion, one hundred twenty million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •