Base | Representation |
---|---|
bin | 111010110101000001100… |
… | …000110010111001000000 |
3 | 112022110211011022000022022 |
4 | 322311001200302321000 |
5 | 1012213333303413012 |
6 | 12333101321301012 |
7 | 565033652300246 |
oct | 72650140627100 |
9 | 15273734260268 |
10 | 4042663341632 |
11 | 13195360786a3 |
12 | 5535b3934768 |
13 | 2342b589ab96 |
14 | dd94751a796 |
15 | 7025b6d5472 |
hex | 3ad41832e40 |
4042663341632 has 84 divisors (see below), whose sum is σ = 8110165217280. Its totient is φ = 1999265087232.
The previous prime is 4042663341571. The next prime is 4042663341649. The reversal of 4042663341632 is 2361433662404.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3967284419 + ... + 3967285437.
It is an arithmetic number, because the mean of its divisors is an integer number (96549585920).
Almost surely, 24042663341632 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 4042663341632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4055082608640).
4042663341632 is an abundant number, since it is smaller than the sum of its proper divisors (4067501875648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4042663341632 is an equidigital number, since it uses as much as digits as its factorization.
4042663341632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2656 (or 1627 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 44.
The spelling of 4042663341632 in words is "four trillion, forty-two billion, six hundred sixty-three million, three hundred forty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •