Base | Representation |
---|---|
bin | 11111001110001110000111… |
… | …101101100000110100111001 |
3 | 200000012100100021020212022000 |
4 | 133032032013231200310321 |
5 | 120444244023111304023 |
6 | 1204014224335051213 |
7 | 40631542150665360 |
oct | 3716160755406471 |
9 | 600170307225260 |
10 | 137316676275513 |
11 | 3a831747a12449 |
12 | 13498a85070b09 |
13 | 5b80ba3919257 |
14 | 25ca23c2287d7 |
15 | 10d1dc64d5243 |
hex | 7ce387b60d39 |
137316676275513 has 64 divisors (see below), whose sum is σ = 234039637777920. Its totient is φ = 77945244039936.
The previous prime is 137316676275461. The next prime is 137316676275551. The reversal of 137316676275513 is 315572676613731.
137316676275513 is a `hidden beast` number, since 1 + 3 + 7 + 3 + 1 + 6 + 6 + 76 + 2 + 7 + 551 + 3 = 666.
It is not a de Polignac number, because 137316676275513 - 29 = 137316676275001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (137316676275913) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 106568131 + ... + 107848967.
It is an arithmetic number, because the mean of its divisors is an integer number (3656869340280).
Almost surely, 2137316676275513 is an apocalyptic number.
It is an amenable number.
137316676275513 is a deficient number, since it is larger than the sum of its proper divisors (96722961502407).
137316676275513 is a wasteful number, since it uses less digits than its factorization.
137316676275513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1284623 (or 1284617 counting only the distinct ones).
The product of its digits is 100018800, while the sum is 63.
The spelling of 137316676275513 in words is "one hundred thirty-seven trillion, three hundred sixteen billion, six hundred seventy-six million, two hundred seventy-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •