Base | Representation |
---|---|
bin | 10000010101101… |
… | …10001101110010 |
3 | 100112220102200000 |
4 | 20022312031302 |
5 | 240041424414 |
6 | 21333410430 |
7 | 3253000302 |
oct | 1012661562 |
9 | 315812600 |
10 | 137061234 |
11 | 70405152 |
12 | 39a99a16 |
13 | 2251b82b |
14 | 142bb602 |
15 | c075b09 |
hex | 82b6372 |
137061234 has 24 divisors (see below), whose sum is σ = 307965840. Its totient is φ = 45686916.
The previous prime is 137061229. The next prime is 137061241. The reversal of 137061234 is 432160731.
137061234 is a `hidden beast` number, since 1 + 370 + 61 + 234 = 666.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 137061198 and 137061207.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 140524 + ... + 141495.
It is an arithmetic number, because the mean of its divisors is an integer number (12831910).
Almost surely, 2137061234 is an apocalyptic number.
137061234 is an abundant number, since it is smaller than the sum of its proper divisors (170904606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137061234 is an equidigital number, since it uses as much as digits as its factorization.
137061234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282036 (or 282024 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 137061234 is about 11707.3154053352. The cubic root of 137061234 is about 515.5904673733.
The spelling of 137061234 in words is "one hundred thirty-seven million, sixty-one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •