Base | Representation |
---|---|
bin | 100001000010110111011… |
… | …0101111000110101011110 |
3 | 121002011202201000020011010 |
4 | 1002011232311320311132 |
5 | 1043402234323131222 |
6 | 13354222312040050 |
7 | 646060034326251 |
oct | 102055665706536 |
9 | 17064681006133 |
10 | 4541640052062 |
11 | 14a110a455533 |
12 | 61424a093026 |
13 | 26c375a15c69 |
14 | 119b6088d098 |
15 | 7d21258680c |
hex | 4216ed78d5e |
4541640052062 has 8 divisors (see below), whose sum is σ = 9083280104136. Its totient is φ = 1513880017352.
The previous prime is 4541640052049. The next prime is 4541640052063. The reversal of 4541640052062 is 2602500461454.
It is a sphenic number, since it is the product of 3 distinct primes.
4541640052062 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 4541640052062.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4541640052063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 378470004333 + ... + 378470004344.
It is an arithmetic number, because the mean of its divisors is an integer number (1135410013017).
Almost surely, 24541640052062 is an apocalyptic number.
4541640052062 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4541640052062 is a wasteful number, since it uses less digits than its factorization.
4541640052062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 756940008682.
The product of its (nonzero) digits is 230400, while the sum is 39.
The spelling of 4541640052062 in words is "four trillion, five hundred forty-one billion, six hundred forty million, fifty-two thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •