Base | Representation |
---|---|
bin | 1001001101001000000010… |
… | …0100100000001011100101 |
3 | 1022211120022212020202102102 |
4 | 2103102000210200023211 |
5 | 2311311003100031041 |
6 | 33305322534221445 |
7 | 2063140202361551 |
oct | 223220044401345 |
9 | 38746285222372 |
10 | 10121100002021 |
11 | 3252375104a18 |
12 | 1175653ab4885 |
13 | 5855531c4458 |
14 | 26dc145b4861 |
15 | 12841678009b |
hex | 934809202e5 |
10121100002021 has 8 divisors (see below), whose sum is σ = 10249743187200. Its totient is φ = 9992470016880.
The previous prime is 10121100002017. The next prime is 10121100002059. The reversal of 10121100002021 is 12020000112101.
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 10121100002021 - 22 = 10121100002017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10121100001993 and 10121100002011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121100002921) 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, 1752185 + ... + 4828286.
It is an arithmetic number, because the mean of its divisors is an integer number (1281217898400).
Almost surely, 210121100002021 is an apocalyptic number.
It is an amenable number.
10121100002021 is a deficient number, since it is larger than the sum of its proper divisors (128643185179).
10121100002021 is an equidigital number, since it uses as much as digits as its factorization.
10121100002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6600019.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10121100002021 its reverse (12020000112101), we get a palindrome (22141100114122).
The spelling of 10121100002021 in words is "ten trillion, one hundred twenty-one billion, one hundred million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •