Base | Representation |
---|---|
bin | 1000000000010010010… |
… | …0101000111000000110 |
3 | 111010221200222200111000 |
4 | 2000010210220320012 |
5 | 4223113002320300 |
6 | 143101313554130 |
7 | 12635523611544 |
oct | 2000444507006 |
9 | 433850880430 |
10 | 137515666950 |
11 | 53358010a32 |
12 | 22799875946 |
13 | cc76c8993c |
14 | 69276d8d94 |
15 | 389ca8cc00 |
hex | 2004928e06 |
137515666950 has 96 divisors (see below), whose sum is σ = 391998794400. Its totient is φ = 35406322560.
The previous prime is 137515666949. The next prime is 137515666993. The reversal of 137515666950 is 59666515731.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 1717117 + ... + 1795416.
It is an arithmetic number, because the mean of its divisors is an integer number (4083320775).
Almost surely, 2137515666950 is an apocalyptic number.
137515666950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
137515666950 is an abundant number, since it is smaller than the sum of its proper divisors (254483127450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137515666950 is a wasteful number, since it uses less digits than its factorization.
137515666950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3512583 (or 3512572 counting only the distinct ones).
The product of its (nonzero) digits is 5103000, while the sum is 54.
The spelling of 137515666950 in words is "one hundred thirty-seven billion, five hundred fifteen million, six hundred sixty-six thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •