Base | Representation |
---|---|
bin | 1100011010011011001… |
… | …00010111111001011000 |
3 | 1111202212201220112100201 |
4 | 12031031210113321120 |
5 | 23441434301034000 |
6 | 523533254311544 |
7 | 42546100620334 |
oct | 6151544277130 |
9 | 1452781815321 |
10 | 426503143000 |
11 | 1549739a5a70 |
12 | 6a7ab0585b4 |
13 | 312b03c758c |
14 | 1690002a7c4 |
15 | b16353696a |
hex | 634d917e58 |
426503143000 has 128 divisors (see below), whose sum is σ = 1089157492800. Its totient is φ = 155033472000.
The previous prime is 426503142977. The next prime is 426503143019. The reversal of 426503143000 is 341305624.
It is a self number, because there is not a number n which added to its sum of digits gives 426503143000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 38153412 + ... + 38164588.
Almost surely, 2426503143000 is an apocalyptic number.
426503143000 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 426503143000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (544578746400).
426503143000 is an abundant number, since it is smaller than the sum of its proper divisors (662654349800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
426503143000 is a wasteful number, since it uses less digits than its factorization.
426503143000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14678 (or 14664 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 426503143000 its reverse (341305624), we get a palindrome (426844448624).
The spelling of 426503143000 in words is "four hundred twenty-six billion, five hundred three million, one hundred forty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •