Base | Representation |
---|---|
bin | 111100011010001001001… |
… | …110011010010111011100 |
3 | 112200212002002200111121020 |
4 | 330122021032122113130 |
5 | 1021003220102231130 |
6 | 12455015330204140 |
7 | 605626420306134 |
oct | 74321116322734 |
9 | 15625062614536 |
10 | 4151240664540 |
11 | 1360593150412 |
12 | 570656123650 |
13 | 2415ca409508 |
14 | 104cc77a7ac4 |
15 | 72eb3958e10 |
hex | 3c68939a5dc |
4151240664540 has 24 divisors (see below), whose sum is σ = 11623473860880. Its totient is φ = 1106997510528.
The previous prime is 4151240664539. The next prime is 4151240664541. The reversal of 4151240664540 is 454660421514.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (4151240664539) and next prime (4151240664541).
It is a junction number, because it is equal to n+sod(n) for n = 4151240664492 and 4151240664501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4151240664541) 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, 34593672145 + ... + 34593672264.
It is an arithmetic number, because the mean of its divisors is an integer number (484311410870).
Almost surely, 24151240664540 is an apocalyptic number.
It is an amenable number.
4151240664540 is an abundant number, since it is smaller than the sum of its proper divisors (7472233196340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4151240664540 is a wasteful number, since it uses less digits than its factorization.
4151240664540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69187344421 (or 69187344419 counting only the distinct ones).
The product of its (nonzero) digits is 460800, while the sum is 42.
The spelling of 4151240664540 in words is "four trillion, one hundred fifty-one billion, two hundred forty million, six hundred sixty-four thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •