Base | Representation |
---|---|
bin | 1000000000101001011… |
… | …0000110101001000001 |
3 | 111011012110020022220001 |
4 | 2000022112012221001 |
5 | 4223312301120001 |
6 | 143115053520001 |
7 | 12641111056135 |
oct | 2001226065101 |
9 | 434173208801 |
10 | 137612520001 |
11 | 533a7753080 |
12 | 228061a3001 |
13 | cc9106ac38 |
14 | 693650b3c5 |
15 | 38a6320001 |
hex | 200a586a41 |
137612520001 has 8 divisors (see below), whose sum is σ = 150127401024. Its totient is φ = 125098414320.
The previous prime is 137612519963. The next prime is 137612520029. The reversal of 137612520001 is 100025216731.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 137612520001 - 27 = 137612519873 is a prime.
It is a super-2 number, since 2×1376125200012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (137612520061) 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, 214731 + ... + 566863.
It is an arithmetic number, because the mean of its divisors is an integer number (18765925128).
Almost surely, 2137612520001 is an apocalyptic number.
137612520001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
137612520001 is a deficient number, since it is larger than the sum of its proper divisors (12514881023).
137612520001 is a wasteful number, since it uses less digits than its factorization.
137612520001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 387671.
The product of its (nonzero) digits is 2520, while the sum is 28.
Adding to 137612520001 its reverse (100025216731), we get a palindrome (237637736732).
The spelling of 137612520001 in words is "one hundred thirty-seven billion, six hundred twelve million, five hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •