Base | Representation |
---|---|
bin | 10000010110011… |
… | …11000100101011 |
3 | 100120002121100000 |
4 | 20023033010223 |
5 | 240103204201 |
6 | 21335514043 |
7 | 3253603164 |
oct | 1013170453 |
9 | 316077300 |
10 | 137163051 |
11 | 704746a3 |
12 | 39b28923 |
13 | 22555c8c |
14 | 1430676b |
15 | c095d86 |
hex | 82cf12b |
137163051 has 12 divisors (see below), whose sum is σ = 205462712. Its totient is φ = 91441872.
The previous prime is 137163031. The next prime is 137163079. The reversal of 137163051 is 150361731.
It is not a de Polignac number, because 137163051 - 27 = 137162923 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (137163031) by changing a digit.
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, 281986 + ... + 282471.
Almost surely, 2137163051 is an apocalyptic number.
137163051 is a deficient number, since it is larger than the sum of its proper divisors (68299661).
137163051 is an frugal number, since it uses more digits than its factorization.
137163051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564472 (or 564460 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 27.
The square root of 137163051 is about 11711.6630330624. The cubic root of 137163051 is about 515.7181058977.
The spelling of 137163051 in words is "one hundred thirty-seven million, one hundred sixty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •