Base | Representation |
---|---|
bin | 110000111011110111101111… |
… | …0000111101101001110000000 |
3 | 2002110001202121010212112022021 |
4 | 1201313233132013231032000 |
5 | 422404321234311000000 |
6 | 4123245520152051224 |
7 | 156444224404431631 |
oct | 14167573607551600 |
9 | 2073052533775267 |
10 | 430441054000000 |
11 | 11517403145396a |
12 | 4033a43a093b14 |
13 | 15624556843a14 |
14 | 784165b32b888 |
15 | 34b6b5dad411a |
hex | 1877bde1ed380 |
430441054000000 has 896 divisors, whose sum is σ = 1170942780490560. Its totient is φ = 156948480000000.
The previous prime is 430441053999977. The next prime is 430441054000057. The reversal of 430441054000000 is 450144034.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 330853999350 + ... + 330854000650.
Almost surely, 2430441054000000 is an apocalyptic number.
430441054000000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 430441054000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (585471390245280).
430441054000000 is an abundant number, since it is smaller than the sum of its proper divisors (740501726490560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
430441054000000 is an equidigital number, since it uses as much as digits as its factorization.
430441054000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1662 (or 1625 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 25.
The spelling of 430441054000000 in words is "four hundred thirty trillion, four hundred forty-one billion, fifty-four million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •