Base | Representation |
---|---|
bin | 1001000010010100… |
… | …0101110010101101 |
3 | 20021001021101111102 |
4 | 2100211011302231 |
5 | 14431431022112 |
6 | 1040405532445 |
7 | 114052422011 |
oct | 22045056255 |
9 | 6231241442 |
10 | 2425642157 |
11 | 1035236944 |
12 | 578414125 |
13 | 2c86c6223 |
14 | 190216541 |
15 | e2e3dbc2 |
hex | 90945cad |
2425642157 has 8 divisors (see below), whose sum is σ = 2527341600. Its totient is φ = 2325146544.
The previous prime is 2425642147. The next prime is 2425642211. The reversal of 2425642157 is 7512465242.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2425642157 - 28 = 2425641901 is a prime.
It is a super-2 number, since 2×24256421572 = 11767479747631225298, 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 2425642157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2425642147) 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, 296843 + ... + 304904.
It is an arithmetic number, because the mean of its divisors is an integer number (315917700).
Almost surely, 22425642157 is an apocalyptic number.
It is an amenable number.
2425642157 is a deficient number, since it is larger than the sum of its proper divisors (101699443).
2425642157 is a wasteful number, since it uses less digits than its factorization.
2425642157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 601915.
The product of its digits is 134400, while the sum is 38.
The square root of 2425642157 is about 49250.8086938682. The cubic root of 2425642157 is about 1343.6172698839.
The spelling of 2425642157 in words is "two billion, four hundred twenty-five million, six hundred forty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •