Base | Representation |
---|---|
bin | 1001010010010011100101… |
… | …1000111100001101110000 |
3 | 1100011002001102122021120122 |
4 | 2110210321120330031300 |
5 | 2314240241111231000 |
6 | 33414242155225412 |
7 | 2102440540631651 |
oct | 224447130741560 |
9 | 40132042567518 |
10 | 10210100102000 |
11 | 3287096370357 |
12 | 118a951a48268 |
13 | 590a67b12bc6 |
14 | 27425878d528 |
15 | 12a8c4e4a085 |
hex | 9493963c370 |
10210100102000 has 40 divisors (see below), whose sum is σ = 24688022051472. Its totient is φ = 4084040040000.
The previous prime is 10210100101991. The next prime is 10210100102011. The reversal of 10210100102000 is 20100101201.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×102101001020002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2552523026 + ... + 2552527025.
Almost surely, 210210100102000 is an apocalyptic number.
10210100102000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10210100102000 is an abundant number, since it is smaller than the sum of its proper divisors (14477921949472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210100102000 is an equidigital number, since it uses as much as digits as its factorization.
10210100102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5105050074 (or 5105050058 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10210100102000 its reverse (20100101201), we get a palindrome (10230200203201).
The spelling of 10210100102000 in words is "ten trillion, two hundred ten billion, one hundred million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.220 sec. • engine limits •