Base | Representation |
---|---|
bin | 1000000000010111… |
… | …0101100011100011 |
3 | 12112202202012122011 |
4 | 2000011311203203 |
5 | 13400121414411 |
6 | 553124453351 |
7 | 104153213104 |
oct | 20005654343 |
9 | 5482665564 |
10 | 2149013731 |
11 | a03075907 |
12 | 4bb84a257 |
13 | 2832bc377 |
14 | 1655a83ab |
15 | c89e9c21 |
hex | 801758e3 |
2149013731 has 4 divisors (see below), whose sum is σ = 2152602000. Its totient is φ = 2145425464.
The previous prime is 2149013723. The next prime is 2149013743. The reversal of 2149013731 is 1373109412.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2149013731 - 23 = 2149013723 is a prime.
It is a super-2 number, since 2×21490137312 = 9236520032053080722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2149013693 and 2149013702.
It is not an unprimeable number, because it can be changed into a prime (2149013701) 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 3 ways as a sum of consecutive naturals, for example, 1793236 + ... + 1794433.
It is an arithmetic number, because the mean of its divisors is an integer number (538150500).
Almost surely, 22149013731 is an apocalyptic number.
2149013731 is a deficient number, since it is larger than the sum of its proper divisors (3588269).
2149013731 is an equidigital number, since it uses as much as digits as its factorization.
2149013731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3588268.
The product of its (nonzero) digits is 4536, while the sum is 31.
The square root of 2149013731 is about 46357.4560453871. The cubic root of 2149013731 is about 1290.4654953277.
The spelling of 2149013731 in words is "two billion, one hundred forty-nine million, thirteen thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •