Base | Representation |
---|---|
bin | 1000000010001001… |
… | …1011100011011111 |
3 | 12120021212000202210 |
4 | 2000202123203133 |
5 | 13404031300112 |
6 | 553553251503 |
7 | 104304012303 |
oct | 20042334337 |
9 | 5507760683 |
10 | 2156509407 |
11 | a07325488 |
12 | 502263b93 |
13 | 284a15090 |
14 | 166599d03 |
15 | c94cab3c |
hex | 8089b8df |
2156509407 has 8 divisors (see below), whose sum is σ = 3096526384. Its totient is φ = 1327082688.
The previous prime is 2156509363. The next prime is 2156509409. The reversal of 2156509407 is 7049056512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2156509407 - 28 = 2156509151 is a prime.
It is a super-3 number, since 3×21565094073 (a number of 29 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 55295113 = 2156509407 / (2 + 1 + 5 + 6 + 5 + 0 + 9 + 4 + 0 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2156509409) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27647518 + ... + 27647595.
It is an arithmetic number, because the mean of its divisors is an integer number (387065798).
Almost surely, 22156509407 is an apocalyptic number.
2156509407 is a deficient number, since it is larger than the sum of its proper divisors (940016977).
2156509407 is a wasteful number, since it uses less digits than its factorization.
2156509407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55295129.
The product of its (nonzero) digits is 75600, while the sum is 39.
The square root of 2156509407 is about 46438.2321691944. The cubic root of 2156509407 is about 1291.9641187194.
The spelling of 2156509407 in words is "two billion, one hundred fifty-six million, five hundred nine thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •