Base | Representation |
---|---|
bin | 11110100100110011011… |
… | …000010100011101001000 |
3 | 21102212022100020212002100 |
4 | 132210303120110131020 |
5 | 233411023330133000 |
6 | 4245122114433400 |
7 | 304541146001232 |
oct | 36446330243510 |
9 | 7385270225070 |
10 | 2101101021000 |
11 | 7400878292a3 |
12 | 29b25a592860 |
13 | 1231961c1417 |
14 | 7399dc37252 |
15 | 399c3c00a00 |
hex | 1e933614748 |
2101101021000 has 96 divisors (see below), whose sum is σ = 7101721481400. Its totient is φ = 560293603200.
The previous prime is 2101101020971. The next prime is 2101101021031. The reversal of 2101101021000 is 1201011012.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 662267184804 + 1438833836196 = 813798^2 + 1199514^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 116718835 + ... + 116736834.
Almost surely, 22101101021000 is an apocalyptic number.
2101101021000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2101101021000 is an abundant number, since it is smaller than the sum of its proper divisors (5000620460400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101101021000 is a wasteful number, since it uses less digits than its factorization.
2101101021000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233455696 (or 233455679 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2101101021000 its reverse (1201011012), we get a palindrome (2102302032012).
The spelling of 2101101021000 in words is "two trillion, one hundred one billion, one hundred one million, twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •