Base | Representation |
---|---|
bin | 111111100000101… |
… | …1000110111110001 |
3 | 12111111222121002011 |
4 | 1333001120313301 |
5 | 13331023223244 |
6 | 551244122521 |
7 | 103544541244 |
oct | 17701306761 |
9 | 5444877064 |
10 | 2131070449 |
11 | 9a3a2a852 |
12 | 4b5836441 |
13 | 27c679141 |
14 | 16305725b |
15 | c7153434 |
hex | 7f058df1 |
2131070449 has 4 divisors (see below), whose sum is σ = 2136015360. Its totient is φ = 2126125540.
The previous prime is 2131070443. The next prime is 2131070519. The reversal of 2131070449 is 9440701312.
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 2131070449 - 27 = 2131070321 is a prime.
It is a super-2 number, since 2×21310704492 = 9082922517202123202, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2131070449.
It is not an unprimeable number, because it can be changed into a prime (2131070443) 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, 2471809 + ... + 2472670.
It is an arithmetic number, because the mean of its divisors is an integer number (534003840).
Almost surely, 22131070449 is an apocalyptic number.
It is an amenable number.
2131070449 is a deficient number, since it is larger than the sum of its proper divisors (4944911).
2131070449 is an equidigital number, since it uses as much as digits as its factorization.
2131070449 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4944910.
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 2131070449 is about 46163.5185942320. The cubic root of 2131070449 is about 1286.8638536936.
The spelling of 2131070449 in words is "two billion, one hundred thirty-one million, seventy thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •