Base | Representation |
---|---|
bin | 1001010010010111000001… |
… | …0001111101101101101010 |
3 | 1100011011102121111202121002 |
4 | 2110211300101331231222 |
5 | 2314244132340120020 |
6 | 33414513413515002 |
7 | 2102502422412056 |
oct | 224456021755552 |
9 | 40134377452532 |
10 | 10211021020010 |
11 | 328751918a718 |
12 | 118ab6a342a62 |
13 | 590b838517c5 |
14 | 274304bd2c66 |
15 | 12a92ac09975 |
hex | 9497047db6a |
10211021020010 has 8 divisors (see below), whose sum is σ = 18379837836036. Its totient is φ = 4084408408000.
The previous prime is 10211021019967. The next prime is 10211021020021. The reversal of 10211021020010 is 1002012011201.
10211021020010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10047055144681 + 163965875329 = 3169709^2 + 404927^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10211021019973 and 10211021020000.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 510551050991 + ... + 510551051010.
Almost surely, 210211021020010 is an apocalyptic number.
10211021020010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10211021020010 is a deficient number, since it is larger than the sum of its proper divisors (8168816816026).
10211021020010 is a wasteful number, since it uses less digits than its factorization.
10211021020010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1021102102008.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10211021020010 its reverse (1002012011201), we get a palindrome (11213033031211).
The spelling of 10211021020010 in words is "ten trillion, two hundred eleven billion, twenty-one million, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •