Base | Representation |
---|---|
bin | 111100110011110… |
… | …0100000101010111 |
3 | 12021012101210120022 |
4 | 1321213210011113 |
5 | 13134321231201 |
6 | 534245055355 |
7 | 101364144320 |
oct | 17147440527 |
9 | 5235353508 |
10 | 2040414551 |
11 | 95784071a |
12 | 48b3b755b |
13 | 2669577b6 |
14 | 154db9447 |
15 | be1e741b |
hex | 799e4157 |
2040414551 has 8 divisors (see below), whose sum is σ = 2332354464. Its totient is φ = 1748587680.
The previous prime is 2040414533. The next prime is 2040414577. The reversal of 2040414551 is 1554140402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2040414551 is a prime.
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 2040414551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2040114551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14801 + ... + 65573.
It is an arithmetic number, because the mean of its divisors is an integer number (291544308).
Almost surely, 22040414551 is an apocalyptic number.
2040414551 is a deficient number, since it is larger than the sum of its proper divisors (291939913).
2040414551 is an equidigital number, since it uses as much as digits as its factorization.
2040414551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56521.
The product of its (nonzero) digits is 3200, while the sum is 26.
The square root of 2040414551 is about 45170.9480861316. The cubic root of 2040414551 is about 1268.3510438504.
Adding to 2040414551 its reverse (1554140402), we get a palindrome (3594554953).
The spelling of 2040414551 in words is "two billion, forty million, four hundred fourteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •