Base | Representation |
---|---|
bin | 111011000001001101100… |
… | …010101111010010111110 |
3 | 112100201121012022012000000 |
4 | 323001031202233102332 |
5 | 1012422134010022203 |
6 | 12343104051415130 |
7 | 566006160603423 |
oct | 73011542572276 |
9 | 15321535265000 |
10 | 4055750079678 |
11 | 1324041206690 |
12 | 5560465b44a6 |
13 | 2355bcc1bb6b |
14 | 1004295c3d4a |
15 | 7077556c4a3 |
hex | 3b04d8af4be |
4055750079678 has 224 divisors, whose sum is σ = 10392593760000. Its totient is φ = 1174505080320.
The previous prime is 4055750079673. The next prime is 4055750079721. The reversal of 4055750079678 is 8769700575504.
4055750079678 is a `hidden beast` number, since 4 + 0 + 5 + 57 + 500 + 7 + 9 + 6 + 78 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4055750079673) 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 111 ways as a sum of consecutive naturals, for example, 460719225 + ... + 460728027.
Almost surely, 24055750079678 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4055750079678, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5196296880000).
4055750079678 is an abundant number, since it is smaller than the sum of its proper divisors (6336843680322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4055750079678 is a wasteful number, since it uses less digits than its factorization.
4055750079678 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10106 (or 10091 counting only the distinct ones).
The product of its (nonzero) digits is 74088000, while the sum is 63.
The spelling of 4055750079678 in words is "four trillion, fifty-five billion, seven hundred fifty million, seventy-nine thousand, six hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •