Base | Representation |
---|---|
bin | 111111100010010… |
… | …0100011010001001 |
3 | 12111120112221200111 |
4 | 1333010210122021 |
5 | 13331231413022 |
6 | 551314034321 |
7 | 103554612646 |
oct | 17704443211 |
9 | 5446487614 |
10 | 2131904137 |
11 | 9a444a150 |
12 | 4b5b789a1 |
13 | 27c8ab74c |
14 | 1631d2dcd |
15 | c726a477 |
hex | 7f124689 |
2131904137 has 4 divisors (see below), whose sum is σ = 2325713616. Its totient is φ = 1938094660.
The previous prime is 2131904113. The next prime is 2131904207. The reversal of 2131904137 is 7314091312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2131904137 - 211 = 2131902089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2131904099 and 2131904108.
It is not an unprimeable number, because it can be changed into a prime (2131904107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 96904723 + ... + 96904744.
It is an arithmetic number, because the mean of its divisors is an integer number (581428404).
Almost surely, 22131904137 is an apocalyptic number.
It is an amenable number.
2131904137 is a deficient number, since it is larger than the sum of its proper divisors (193809479).
2131904137 is a wasteful number, since it uses less digits than its factorization.
2131904137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193809478.
The product of its (nonzero) digits is 4536, while the sum is 31.
The square root of 2131904137 is about 46172.5474389274. The cubic root of 2131904137 is about 1287.0316415272.
Adding to 2131904137 its reverse (7314091312), we get a palindrome (9445995449).
The spelling of 2131904137 in words is "two billion, one hundred thirty-one million, nine hundred four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •