Base | Representation |
---|---|
bin | 1001001101101100111101… |
… | …0000111110111111110101 |
3 | 1022212111220112001222210112 |
4 | 2103123033100332333311 |
5 | 2311441302104020041 |
6 | 33314042152432405 |
7 | 2063640610006445 |
oct | 223331720767765 |
9 | 38774815058715 |
10 | 10131010220021 |
11 | 32565a0177429 |
12 | 117755a9a8705 |
13 | 586472407c82 |
14 | 2704b4846125 |
15 | 1287e6805deb |
hex | 936cf43eff5 |
10131010220021 has 8 divisors (see below), whose sum is σ = 10471105231104. Its totient is φ = 9791745723360.
The previous prime is 10131010220011. The next prime is 10131010220027. The reversal of 10131010220021 is 12002201013101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10131010220021 - 214 = 10131010203637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10131010219978 and 10131010220005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131010220027) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 207603800 + ... + 207652593.
It is an arithmetic number, because the mean of its divisors is an integer number (1308888153888).
Almost surely, 210131010220021 is an apocalyptic number.
It is an amenable number.
10131010220021 is a deficient number, since it is larger than the sum of its proper divisors (340095011083).
10131010220021 is an equidigital number, since it uses as much as digits as its factorization.
10131010220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 415257211.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10131010220021 its reverse (12002201013101), we get a palindrome (22133211233122).
The spelling of 10131010220021 in words is "ten trillion, one hundred thirty-one billion, ten million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •