Base | Representation |
---|---|
bin | 1001001100100110001011… |
… | …0101111001110000000101 |
3 | 1022210200212110021110202102 |
4 | 2103021202311321300011 |
5 | 2311133344343442013 |
6 | 33301221024121445 |
7 | 2062366031652443 |
oct | 223114265716005 |
9 | 38720773243672 |
10 | 10112011312133 |
11 | 3249530847765 |
12 | 1173938166285 |
13 | 584735260643 |
14 | 26d5d14b3b93 |
15 | 1280838d4d58 |
hex | 93262d79c05 |
10112011312133 has 4 divisors (see below), whose sum is σ = 10132114714848. Its totient is φ = 10091907909420.
The previous prime is 10112011312121. The next prime is 10112011312171. The reversal of 10112011312133 is 33121311021101.
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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10112011312133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112011342133) 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, 10051700603 + ... + 10051701608.
It is an arithmetic number, because the mean of its divisors is an integer number (2533028678712).
Almost surely, 210112011312133 is an apocalyptic number.
It is an amenable number.
10112011312133 is a deficient number, since it is larger than the sum of its proper divisors (20103402715).
10112011312133 is an equidigital number, since it uses as much as digits as its factorization.
10112011312133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20103402714.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 10112011312133 its reverse (33121311021101), we get a palindrome (43233322333234).
The spelling of 10112011312133 in words is "ten trillion, one hundred twelve billion, eleven million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •