Base | Representation |
---|---|
bin | 110000001111010101110111… |
… | …0011110111010110000100000 |
3 | 2001122101200200001210011010212 |
4 | 1200132223232132322300200 |
5 | 421104033402012422144 |
6 | 4102242213145513252 |
7 | 155243115642003455 |
oct | 14036535636726040 |
9 | 2048350601704125 |
10 | 424321000123424 |
11 | 1132245865a90a8 |
12 | 3b7103044a2828 |
13 | 1529c3b60b4b41 |
14 | 76ad362dad82c |
15 | 340c86a0a249e |
hex | 181eaee7bac20 |
424321000123424 has 96 divisors (see below), whose sum is σ = 844620015931776. Its totient is φ = 209819270707200.
The previous prime is 424321000123421. The next prime is 424321000123439.
It is a happy number.
424321000123424 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×4243210001234242 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (424321000123421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12031655039 + ... + 12031690305.
It is an arithmetic number, because the mean of its divisors is an integer number (8798125165956).
Almost surely, 2424321000123424 is an apocalyptic number.
It is an amenable number.
424321000123424 is a deficient number, since it is larger than the sum of its proper divisors (420299015808352).
424321000123424 is a wasteful number, since it uses less digits than its factorization.
424321000123424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39538 (or 39530 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 32.
It can be divided in two parts, 424321000 and 123424, that added together give a palindrome (424444424).
The spelling of 424321000123424 in words is "four hundred twenty-four trillion, three hundred twenty-one billion, one hundred twenty-three thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •