Base | Representation |
---|---|
bin | 1001010010010011100101… |
… | …1000100011100011110010 |
3 | 1100011002001102110011001021 |
4 | 2110210321120203203302 |
5 | 2314240241100013020 |
6 | 33414242153130054 |
7 | 2102440540031350 |
oct | 224447130434362 |
9 | 40132042404037 |
10 | 10210100001010 |
11 | 3287096301498 |
12 | 118a9519b992a |
13 | 590a67aa8c50 |
14 | 2742587647d0 |
15 | 12a8c4e2a1aa |
hex | 949396238f2 |
10210100001010 has 128 divisors (see below), whose sum is σ = 23537627688960. Its totient is φ = 3102685883136.
The previous prime is 10210100000987. The next prime is 10210100001037. The reversal of 10210100001010 is 1010000101201.
It is a super-2 number, since 2×102101000010102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 10210100000984 and 10210100001002.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 97419 + ... + 4519921.
It is an arithmetic number, because the mean of its divisors is an integer number (183887716320).
Almost surely, 210210100001010 is an apocalyptic number.
10210100001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10210100001010 is an abundant number, since it is smaller than the sum of its proper divisors (13327527687950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210100001010 is a wasteful number, since it uses less digits than its factorization.
10210100001010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4422632.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 10210100001010 its reverse (1010000101201), we get a palindrome (11220100102211).
The spelling of 10210100001010 in words is "ten trillion, two hundred ten billion, one hundred million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •