Base | Representation |
---|---|
bin | 1001110001000010101010… |
… | …1011110100110010101101 |
3 | 1102000120000001021102212222 |
4 | 2130100222223310302231 |
5 | 2401413144344342001 |
6 | 34501010354205125 |
7 | 2155542660105425 |
oct | 234205253646255 |
9 | 42016001242788 |
10 | 10738134371501 |
11 | 3470020a01419 |
12 | 12551575837a5 |
13 | 5cb7a8cb9b14 |
14 | 291a2ad23485 |
15 | 1394cbd1361b |
hex | 9c42aaf4cad |
10738134371501 has 16 divisors (see below), whose sum is σ = 11120512666560. Its totient is φ = 10356565080960.
The previous prime is 10738134371491. The next prime is 10738134371599. The reversal of 10738134371501 is 10517343183701.
10738134371501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10738134371501 is a prime.
It is a super-2 number, since 2×107381343715012 (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 (10738134371101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 333435266 + ... + 333467468.
It is an arithmetic number, because the mean of its divisors is an integer number (695032041660).
Almost surely, 210738134371501 is an apocalyptic number.
It is an amenable number.
10738134371501 is a deficient number, since it is larger than the sum of its proper divisors (382378295059).
10738134371501 is a wasteful number, since it uses less digits than its factorization.
10738134371501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44396.
The product of its (nonzero) digits is 211680, while the sum is 44.
The spelling of 10738134371501 in words is "ten trillion, seven hundred thirty-eight billion, one hundred thirty-four million, three hundred seventy-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •