Base | Representation |
---|---|
bin | 1000000000001000111… |
… | …0101101011100011101 |
3 | 111010211222000220001110 |
4 | 2000002032231130131 |
5 | 4223022422122221 |
6 | 143053351332233 |
7 | 12634535546061 |
oct | 2000216553435 |
9 | 433758026043 |
10 | 137476364061 |
11 | 53337907103 |
12 | 22788681079 |
13 | cc6baa84aa |
14 | 69223c7aa1 |
15 | 38993c7776 |
hex | 20023ad71d |
137476364061 has 4 divisors (see below), whose sum is σ = 183301818752. Its totient is φ = 91650909372.
The previous prime is 137476363993. The next prime is 137476364089. The reversal of 137476364061 is 160463674731.
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 not a de Polignac number, because 137476364061 - 213 = 137476355869 is a prime.
It is a super-2 number, since 2×1374763640612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 137476364061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137476164061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22912727341 + ... + 22912727346.
It is an arithmetic number, because the mean of its divisors is an integer number (45825454688).
Almost surely, 2137476364061 is an apocalyptic number.
It is an amenable number.
137476364061 is a deficient number, since it is larger than the sum of its proper divisors (45825454691).
137476364061 is an equidigital number, since it uses as much as digits as its factorization.
137476364061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45825454690.
The product of its (nonzero) digits is 1524096, while the sum is 48.
The spelling of 137476364061 in words is "one hundred thirty-seven billion, four hundred seventy-six million, three hundred sixty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •