Base | Representation |
---|---|
bin | 1001010010010011111111… |
… | …1101000000011111110101 |
3 | 1100011002100002211212002212 |
4 | 2110210333331000133311 |
5 | 2314241002304020041 |
6 | 33414301131343205 |
7 | 2102443345624520 |
oct | 224447775003765 |
9 | 40132302755085 |
10 | 10210210220021 |
11 | 3287142542689 |
12 | 118a9828b1b05 |
13 | 590a84889bb6 |
14 | 274269255bb7 |
15 | 12a8ce94c8eb |
hex | 9493ff407f5 |
10210210220021 has 8 divisors (see below), whose sum is σ = 11670161212800. Its totient is φ = 8750596610448.
The previous prime is 10210210220003. The next prime is 10210210220033. The reversal of 10210210220021 is 12002201201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10210210220021 - 218 = 10210209957877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10210210219978 and 10210210220005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210210210021) 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, 84280946 + ... + 84402003.
It is an arithmetic number, because the mean of its divisors is an integer number (1458770151600).
Almost surely, 210210210220021 is an apocalyptic number.
It is an amenable number.
10210210220021 is a deficient number, since it is larger than the sum of its proper divisors (1459950992779).
10210210220021 is an equidigital number, since it uses as much as digits as its factorization.
10210210220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168691603.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10210210220021 its reverse (12002201201201), we get a palindrome (22212411421222).
The spelling of 10210210220021 in words is "ten trillion, two hundred ten billion, two hundred ten million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •