Base | Representation |
---|---|
bin | 1000000010000000110… |
… | …1101000010110000100 |
3 | 111012011000120122012212 |
4 | 2000200031220112010 |
5 | 4230040211210013 |
6 | 143215321202552 |
7 | 12653154345641 |
oct | 2004015502604 |
9 | 435130518185 |
10 | 137979397508 |
11 | 53575855627 |
12 | 228a9030458 |
13 | 1001c083214 |
14 | 696d12cdc8 |
15 | 38c863e6a8 |
hex | 2020368584 |
137979397508 has 24 divisors (see below), whose sum is σ = 244744778880. Its totient is φ = 68053920480.
The previous prime is 137979397487. The next prime is 137979397537. The reversal of 137979397508 is 805793979731.
It is a super-2 number, since 2×1379793975082 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (68) coincides with the sum of the digits of its prime factors.
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 7 ways as a sum of consecutive naturals, for example, 145643 + ... + 545133.
It is an arithmetic number, because the mean of its divisors is an integer number (10197699120).
Almost surely, 2137979397508 is an apocalyptic number.
It is an amenable number.
137979397508 is a deficient number, since it is larger than the sum of its proper divisors (106765381372).
137979397508 is a wasteful number, since it uses less digits than its factorization.
137979397508 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400667 (or 400665 counting only the distinct ones).
The product of its (nonzero) digits is 90016920, while the sum is 68.
The spelling of 137979397508 in words is "one hundred thirty-seven billion, nine hundred seventy-nine million, three hundred ninety-seven thousand, five hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •