Base | Representation |
---|---|
bin | 1000000010010011… |
… | …1001100011111111 |
3 | 12120100001220120011 |
4 | 2000210321203333 |
5 | 13404213002412 |
6 | 554015204051 |
7 | 104312346214 |
oct | 20044714377 |
9 | 5510056504 |
10 | 2157156607 |
11 | a07727761 |
12 | 502516627 |
13 | 284bb0838 |
14 | 1666c7b0b |
15 | c95a77a7 |
hex | 809398ff |
2157156607 has 8 divisors (see below), whose sum is σ = 2240930432. Its totient is φ = 2074269600.
The previous prime is 2157156587. The next prime is 2157156611. The reversal of 2157156607 is 7066517512.
It is a happy number.
2157156607 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2157156607 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 2157156607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2157156667) 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, 216744 + ... + 226477.
It is an arithmetic number, because the mean of its divisors is an integer number (280116304).
Almost surely, 22157156607 is an apocalyptic number.
2157156607 is a deficient number, since it is larger than the sum of its proper divisors (83773825).
2157156607 is a wasteful number, since it uses less digits than its factorization.
2157156607 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 443409.
The product of its (nonzero) digits is 88200, while the sum is 40.
The square root of 2157156607 is about 46445.2000426309. The cubic root of 2157156607 is about 1292.0933515653.
The spelling of 2157156607 in words is "two billion, one hundred fifty-seven million, one hundred fifty-six thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •