Base | Representation |
---|---|
bin | 1001000111001111110100… |
… | …1110100111100100100101 |
3 | 1022110220122211212222022112 |
4 | 2101303331032213210211 |
5 | 2303132142210431041 |
6 | 33151102003210405 |
7 | 2052633502263635 |
oct | 221637516474445 |
9 | 38426584788275 |
10 | 10020112202021 |
11 | 3213562129089 |
12 | 1159b6b376a05 |
13 | 578b7ab5988c |
14 | 268d942a06c5 |
15 | 1259a5973deb |
hex | 91cfd3a7925 |
10020112202021 has 8 divisors (see below), whose sum is σ = 10170996177600. Its totient is φ = 9869267346048.
The previous prime is 10020112201997. The next prime is 10020112202047. The reversal of 10020112202021 is 12020221102001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10020112202021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10020112201987 and 10020112202005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020112202071) 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, 9263561 + ... + 10288526.
It is an arithmetic number, because the mean of its divisors is an integer number (1271374522200).
Almost surely, 210020112202021 is an apocalyptic number.
It is an amenable number.
10020112202021 is a deficient number, since it is larger than the sum of its proper divisors (150883975579).
10020112202021 is an equidigital number, since it uses as much as digits as its factorization.
10020112202021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19559803.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10020112202021 its reverse (12020221102001), we get a palindrome (22040333304022).
The spelling of 10020112202021 in words is "ten trillion, twenty billion, one hundred twelve million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •