Base | Representation |
---|---|
bin | 10000011000110… |
… | …10010001101001 |
3 | 100120200020212112 |
4 | 20030122101221 |
5 | 240143033311 |
6 | 21350252105 |
7 | 3256325216 |
oct | 1014322151 |
9 | 316606775 |
10 | 137471081 |
11 | 70665070 |
12 | 3a057035 |
13 | 22633247 |
14 | 14386b0d |
15 | c10728b |
hex | 831a469 |
137471081 has 8 divisors (see below), whose sum is σ = 154806528. Its totient is φ = 120942000.
The previous prime is 137471077. The next prime is 137471111. The reversal of 137471081 is 180174731.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 137471081 - 22 = 137471077 is a prime.
It is a super-2 number, since 2×1374710812 = 37796596222617122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (137471011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 201230 + ... + 201911.
It is an arithmetic number, because the mean of its divisors is an integer number (19350816).
Almost surely, 2137471081 is an apocalyptic number.
137471081 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
137471081 is a deficient number, since it is larger than the sum of its proper divisors (17335447).
137471081 is a wasteful number, since it uses less digits than its factorization.
137471081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403183.
The product of its (nonzero) digits is 4704, while the sum is 32.
The square root of 137471081 is about 11724.8062244116. The cubic root of 137471081 is about 516.1038703321.
The spelling of 137471081 in words is "one hundred thirty-seven million, four hundred seventy-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •