| Base | Representation |
|---|---|
| bin | 10110111101111001000101… |
| … | …000110100101010101001000 |
| 3 | 111020122110222112020212110201 |
| 4 | 112331321011012211111020 |
| 5 | 101214422342224033000 |
| 6 | 554455240111221544 |
| 7 | 30163513632301030 |
| oct | 2675710506452510 |
| 9 | 436573875225421 |
| 10 | 101010200221000 |
| 11 | 2a204204770084 |
| 12 | b3b45538178b4 |
| 13 | 44492b47329c5 |
| 14 | 1ad2cc3c1a8c0 |
| 15 | ba279179396a |
| hex | 5bde451a5548 |
101010200221000 has 128 divisors (see below), whose sum is σ = 270180436930560. Its totient is φ = 34625619744000.
The previous prime is 101010200220997. The next prime is 101010200221003. The reversal of 101010200221000 is 122002010101.
It is an interprime number because it is at equal distance from previous prime (101010200220997) and next prime (101010200221003).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (101010200221003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36326169 + ... + 39007831.
It is an arithmetic number, because the mean of its divisors is an integer number (2110784663520).
Almost surely, 2101010200221000 is an apocalyptic number.
101010200221000 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 101010200221000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135090218465280).
101010200221000 is an abundant number, since it is smaller than the sum of its proper divisors (169170236709560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101010200221000 is a wasteful number, since it uses less digits than its factorization.
101010200221000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2687072 (or 2687058 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 101010200221000 its reverse (122002010101), we get a palindrome (101132202231101).
The spelling of 101010200221000 in words is "one hundred one trillion, ten billion, two hundred million, two hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.201 sec. • engine limits •