Base | Representation |
---|---|
bin | 1001001101111000100101… |
… | …1111110011001101000011 |
3 | 1022212210222021021021222212 |
4 | 2103132021133303031003 |
5 | 2312014201433303201 |
6 | 33315320204252335 |
7 | 2064111206241524 |
oct | 223361137631503 |
9 | 38783867237885 |
10 | 10134134666051 |
11 | 3257953905a30 |
12 | 11780912410ab |
13 | 58684c811cc6 |
14 | 2706cd7a484b |
15 | 12892ac7cabb |
hex | 937897f3343 |
10134134666051 has 8 divisors (see below), whose sum is σ = 11436641002800. Its totient is φ = 8895165223840.
The previous prime is 10134134666009. The next prime is 10134134666059. The reversal of 10134134666051 is 15066643143101.
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-10134134666051 is a prime.
It is a super-2 number, since 2×101341346660512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10134134666059) 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, 15884223296 + ... + 15884223933.
It is an arithmetic number, because the mean of its divisors is an integer number (1429580125350).
Almost surely, 210134134666051 is an apocalyptic number.
10134134666051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10134134666051 is a deficient number, since it is larger than the sum of its proper divisors (1302506336749).
10134134666051 is a wasteful number, since it uses less digits than its factorization.
10134134666051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31768447269.
The product of its (nonzero) digits is 155520, while the sum is 41.
The spelling of 10134134666051 in words is "ten trillion, one hundred thirty-four billion, one hundred thirty-four million, six hundred sixty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •