Base | Representation |
---|---|
bin | 11111010000000010100001… |
… | …011100011010010100110000 |
3 | 200000122021221202001010212020 |
4 | 133100002201130122110300 |
5 | 121003321010441123012 |
6 | 1204151454454031440 |
7 | 40643555340364251 |
oct | 3720024134322460 |
9 | 600567852033766 |
10 | 137441662051632 |
11 | 3a87a7551499a4 |
12 | 134b9146648580 |
13 | 5b8c901a21bb3 |
14 | 25d22d77acb28 |
15 | 10d528e032a8c |
hex | 7d00a171a530 |
137441662051632 has 160 divisors (see below), whose sum is σ = 397428284747520. Its totient is φ = 40674213273600.
The previous prime is 137441662051601. The next prime is 137441662051709. The reversal of 137441662051632 is 236150266144731.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 15410994 + ... + 22635857.
It is an arithmetic number, because the mean of its divisors is an integer number (2483926779672).
Almost surely, 2137441662051632 is an apocalyptic number.
137441662051632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
137441662051632 is an abundant number, since it is smaller than the sum of its proper divisors (259986622695888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137441662051632 is a wasteful number, since it uses less digits than its factorization.
137441662051632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38047131 (or 38047125 counting only the distinct ones).
The product of its (nonzero) digits is 4354560, while the sum is 51.
The spelling of 137441662051632 in words is "one hundred thirty-seven trillion, four hundred forty-one billion, six hundred sixty-two million, fifty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •