Base | Representation |
---|---|
bin | 111100010010001010001… |
… | …010100001011010100000 |
3 | 112200000221112212011211000 |
4 | 330102022022201122200 |
5 | 1020333140110044311 |
6 | 12451040435552000 |
7 | 605204065100250 |
oct | 74221212413240 |
9 | 15600845764730 |
10 | 4142666487456 |
11 | 1357993262252 |
12 | 56aa6275b600 |
13 | 240861c3c453 |
14 | 104712b59960 |
15 | 72b60d42056 |
hex | 3c48a2a16a0 |
4142666487456 has 384 divisors, whose sum is σ = 14641772544000. Its totient is φ = 1112425132032.
The previous prime is 4142666487433. The next prime is 4142666487493. The reversal of 4142666487456 is 6547846662414.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a junction number, because it is equal to n+sod(n) for n = 4142666487393 and 4142666487402.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 73896685 + ... + 73952723.
It is an arithmetic number, because the mean of its divisors is an integer number (38129616000).
Almost surely, 24142666487456 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4142666487456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7320886272000).
4142666487456 is an abundant number, since it is smaller than the sum of its proper divisors (10499106056544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4142666487456 is a wasteful number, since it uses less digits than its factorization.
4142666487456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56801 (or 56787 counting only the distinct ones).
The product of its digits is 185794560, while the sum is 63.
The spelling of 4142666487456 in words is "four trillion, one hundred forty-two billion, six hundred sixty-six million, four hundred eighty-seven thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •