Base | Representation |
---|---|
bin | 1001000111010000010011… |
… | …0111101111000011110111 |
3 | 1022110220222210011011211201 |
4 | 2101310010313233003313 |
5 | 2303132423021433421 |
6 | 33151122423313331 |
7 | 2052636620156344 |
oct | 221640467570367 |
9 | 38426883134751 |
10 | 10020240421111 |
11 | 3213618543a78 |
12 | 1159ba62ab847 |
13 | 578b9b5a086b |
14 | 268da73197cb |
15 | 1259b1d4eb91 |
hex | 91d04def0f7 |
10020240421111 has 4 divisors (see below), whose sum is σ = 10020993100272. Its totient is φ = 10019487741952.
The previous prime is 10020240421031. The next prime is 10020240421133. The reversal of 10020240421111 is 11112404202001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10020240421111 is a prime.
It is a super-2 number, since 2×100202404211112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020240421171) 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, 376319611 + ... + 376346236.
It is an arithmetic number, because the mean of its divisors is an integer number (2505248275068).
Almost surely, 210020240421111 is an apocalyptic number.
10020240421111 is a deficient number, since it is larger than the sum of its proper divisors (752679161).
10020240421111 is an equidigital number, since it uses as much as digits as its factorization.
10020240421111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 752679160.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 10020240421111 its reverse (11112404202001), we get a palindrome (21132644623112).
The spelling of 10020240421111 in words is "ten trillion, twenty billion, two hundred forty million, four hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •