Base | Representation |
---|---|
bin | 111100000010100001000… |
… | …000000001000001110111 |
3 | 112121102120221211000011222 |
4 | 330002201000001001313 |
5 | 1020044240123141101 |
6 | 12435222015220555 |
7 | 604040620101425 |
oct | 74024100010167 |
9 | 15542527730158 |
10 | 4125869740151 |
11 | 13508539a8405 |
12 | 56775551775b |
13 | 23c0b60a1a13 |
14 | 10399c068115 |
15 | 724cb41801b |
hex | 3c0a1001077 |
4125869740151 has 8 divisors (see below), whose sum is σ = 4131036280224. Its totient is φ = 4120705459360.
The previous prime is 4125869740127. The next prime is 4125869740169. The reversal of 4125869740151 is 1510479685214.
It is a happy number.
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 4125869740151 - 222 = 4125865545847 is a prime.
It is a super-2 number, since 2×41258697401512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4125869740093 and 4125869740102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4125869740351) 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, 3104741 + ... + 4229793.
It is an arithmetic number, because the mean of its divisors is an integer number (516379535028).
Almost surely, 24125869740151 is an apocalyptic number.
4125869740151 is a deficient number, since it is larger than the sum of its proper divisors (5166540073).
4125869740151 is a wasteful number, since it uses less digits than its factorization.
4125869740151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1129641.
The product of its (nonzero) digits is 2419200, while the sum is 53.
The spelling of 4125869740151 in words is "four trillion, one hundred twenty-five billion, eight hundred sixty-nine million, seven hundred forty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •