Base | Representation |
---|---|
bin | 1000101110000000… |
… | …1000000010010111 |
3 | 20001002222102001220 |
4 | 2023200020002113 |
5 | 14243124021201 |
6 | 1024124021423 |
7 | 111666351441 |
oct | 21340100227 |
9 | 6032872056 |
10 | 2340454551 |
11 | aa1142166 |
12 | 553991873 |
13 | 2b3b6a866 |
14 | 182b9d491 |
15 | da713036 |
hex | 8b808097 |
2340454551 has 8 divisors (see below), whose sum is σ = 3121163520. Its totient is φ = 1560024312.
The previous prime is 2340454489. The next prime is 2340454577. The reversal of 2340454551 is 1554540432.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2340454551 - 211 = 2340452503 is a prime.
It is a super-2 number, since 2×23404545512 = 10955455010593223202, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2340454591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49231 + ... + 84288.
It is an arithmetic number, because the mean of its divisors is an integer number (390145440).
Almost surely, 22340454551 is an apocalyptic number.
2340454551 is a deficient number, since it is larger than the sum of its proper divisors (780708969).
2340454551 is a wasteful number, since it uses less digits than its factorization.
2340454551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139365.
The product of its (nonzero) digits is 48000, while the sum is 33.
The square root of 2340454551 is about 48378.2446043674. The cubic root of 2340454551 is about 1327.7003528629.
Adding to 2340454551 its reverse (1554540432), we get a palindrome (3894994983).
The spelling of 2340454551 in words is "two billion, three hundred forty million, four hundred fifty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •