Base | Representation |
---|---|
bin | 100001101011110000100… |
… | …1011011101001101110000 |
3 | 121101120102212022122211022 |
4 | 1003113201023131031300 |
5 | 1101322112124422030 |
6 | 13502424332035012 |
7 | 655316163536150 |
oct | 103274113351560 |
9 | 17346385278738 |
10 | 4629457654640 |
11 | 152538417a095 |
12 | 629278002a68 |
13 | 27772c65aa00 |
14 | 1200d19b2760 |
15 | 80652021de5 |
hex | 435e12dd370 |
4629457654640 has 120 divisors (see below), whose sum is σ = 13320159160608. Its totient is φ = 1465147008000.
The previous prime is 4629457654637. The next prime is 4629457654649. The reversal of 4629457654640 is 464567549264.
It is a happy number.
It is a super-2 number, since 2×46294576546402 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4629457654649) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24363611 + ... + 24552890.
Almost surely, 24629457654640 is an apocalyptic number.
4629457654640 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4629457654640 is an abundant number, since it is smaller than the sum of its proper divisors (8690701505968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4629457654640 is a wasteful number, since it uses less digits than its factorization.
4629457654640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48916547 (or 48916528 counting only the distinct ones).
The product of its (nonzero) digits is 174182400, while the sum is 62.
The spelling of 4629457654640 in words is "four trillion, six hundred twenty-nine billion, four hundred fifty-seven million, six hundred fifty-four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •