Base | Representation |
---|---|
bin | 11101011001101001011… |
… | …10111010111111000101 |
3 | 10120120111201100020200210 |
4 | 32230310232322333011 |
5 | 113022343204430041 |
6 | 2052025211230033 |
7 | 132661514401542 |
oct | 16546456727705 |
9 | 3516451306623 |
10 | 1010202030021 |
11 | 35a47378a068 |
12 | 14394a748319 |
13 | 74352aa12b2 |
14 | 36c73359bc9 |
15 | 1b427230016 |
hex | eb34bbafc5 |
1010202030021 has 4 divisors (see below), whose sum is σ = 1346936040032. Its totient is φ = 673468020012.
The previous prime is 1010202030017. The next prime is 1010202030049. The reversal of 1010202030021 is 1200302020101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1010202030021 - 22 = 1010202030017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010202029979 and 1010202030006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010202030421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 168367005001 + ... + 168367005006.
It is an arithmetic number, because the mean of its divisors is an integer number (336734010008).
Almost surely, 21010202030021 is an apocalyptic number.
It is an amenable number.
1010202030021 is a deficient number, since it is larger than the sum of its proper divisors (336734010011).
1010202030021 is an equidigital number, since it uses as much as digits as its factorization.
1010202030021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336734010010.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1010202030021 its reverse (1200302020101), we get a palindrome (2210504050122).
The spelling of 1010202030021 in words is "one trillion, ten billion, two hundred two million, thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •