Base | Representation |
---|---|
bin | 1001000111010011001101… |
… | …0101101000101010111001 |
3 | 1022111000000010002110101110 |
4 | 2101310303111220222321 |
5 | 2303141022110324233 |
6 | 33151332032510533 |
7 | 2052665134445622 |
oct | 221646325505271 |
9 | 38430003073343 |
10 | 10021020011193 |
11 | 32139886045a4 |
12 | 115a1833ab449 |
13 | 578c93c58879 |
14 | 26903ca90a49 |
15 | 125a0a4e4663 |
hex | 91d33568ab9 |
10021020011193 has 8 divisors (see below), whose sum is σ = 13361400816768. Its totient is φ = 6680659606544.
The previous prime is 10021020011173. The next prime is 10021020011201. The reversal of 10021020011193 is 39111002012001.
It is a happy number.
10021020011193 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10021020011193 - 25 = 10021020011161 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10021020011173) 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, 3914721 + ... + 5947022.
It is an arithmetic number, because the mean of its divisors is an integer number (1670175102096).
Almost surely, 210021020011193 is an apocalyptic number.
It is an amenable number.
10021020011193 is a deficient number, since it is larger than the sum of its proper divisors (3340380805575).
10021020011193 is an equidigital number, since it uses as much as digits as its factorization.
10021020011193 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10200463.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 10021020011193 its reverse (39111002012001), we get a palindrome (49132022023194).
The spelling of 10021020011193 in words is "ten trillion, twenty-one billion, twenty million, eleven thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •