Base | Representation |
---|---|
bin | 1001001001000011010011… |
… | …0110000011000010100101 |
3 | 1022120212200010211010011011 |
4 | 2102100310312003002211 |
5 | 2304134133133243401 |
6 | 33213225522542221 |
7 | 2055111606555232 |
oct | 222206466030245 |
9 | 38525603733134 |
10 | 10051110056101 |
11 | 322571965a704 |
12 | 1163b80507971 |
13 | 57ba7ab8a17a |
14 | 26a695058789 |
15 | 1266bbea8451 |
hex | 92434d830a5 |
10051110056101 has 4 divisors (see below), whose sum is σ = 10061723689632. Its totient is φ = 10040496422572.
The previous prime is 10051110056093. The next prime is 10051110056111. The reversal of 10051110056101 is 10165001115001.
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 not a de Polignac number, because 10051110056101 - 23 = 10051110056093 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 (10051110056111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5306815345 + ... + 5306817238.
It is an arithmetic number, because the mean of its divisors is an integer number (2515430922408).
Almost surely, 210051110056101 is an apocalyptic number.
It is an amenable number.
10051110056101 is a deficient number, since it is larger than the sum of its proper divisors (10613633531).
10051110056101 is an equidigital number, since it uses as much as digits as its factorization.
10051110056101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10613633530.
The product of its (nonzero) digits is 150, while the sum is 22.
The spelling of 10051110056101 in words is "ten trillion, fifty-one billion, one hundred ten million, fifty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •