Base | Representation |
---|---|
bin | 1000000000101001011… |
… | …0100111101011110111 |
3 | 111011012110111012120000 |
4 | 2000022112213223313 |
5 | 4223312314432401 |
6 | 143115100442343 |
7 | 12641112161553 |
oct | 2001226475367 |
9 | 434173435500 |
10 | 137612655351 |
11 | 533a7835836 |
12 | 228062493b3 |
13 | cc910b7722 |
14 | 6936544863 |
15 | 38a634a186 |
hex | 200a5a7af7 |
137612655351 has 10 divisors (see below), whose sum is σ = 205569522312. Its totient is φ = 91741770180.
The previous prime is 137612655347. The next prime is 137612655407. The reversal of 137612655351 is 153556216731.
137612655351 is a `hidden beast` number, since 1 + 3 + 76 + 1 + 26 + 553 + 5 + 1 = 666.
137612655351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 137612655351 - 22 = 137612655347 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 137612655297 and 137612655306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137612655311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 849460755 + ... + 849460916.
Almost surely, 2137612655351 is an apocalyptic number.
137612655351 is a deficient number, since it is larger than the sum of its proper divisors (67956866961).
137612655351 is an equidigital number, since it uses as much as digits as its factorization.
137612655351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1698921683 (or 1698921674 counting only the distinct ones).
The product of its digits is 567000, while the sum is 45.
The spelling of 137612655351 in words is "one hundred thirty-seven billion, six hundred twelve million, six hundred fifty-five thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •