Base | Representation |
---|---|
bin | 1100010000100111001… |
… | …10011110110111010000 |
3 | 1111021021122012011101101 |
4 | 12020103212132313100 |
5 | 23400142311300000 |
6 | 521302445514144 |
7 | 42301416643024 |
oct | 6102346366720 |
9 | 1437248164341 |
10 | 421235650000 |
11 | 1527105a7570 |
12 | 6977ab72954 |
13 | 30951010009 |
14 | 16560618384 |
15 | ae55d92e6a |
hex | 621399edd0 |
421235650000 has 240 divisors, whose sum is σ = 1124019058176. Its totient is φ = 151640000000.
The previous prime is 421235649949. The next prime is 421235650007. The reversal of 421235650000 is 56532124.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421235650007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 55546209 + ... + 55553791.
Almost surely, 2421235650000 is an apocalyptic number.
421235650000 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 421235650000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (562009529088).
421235650000 is an abundant number, since it is smaller than the sum of its proper divisors (702783408176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421235650000 is a wasteful number, since it uses less digits than its factorization.
421235650000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7728 (or 7702 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
The spelling of 421235650000 in words is "four hundred twenty-one billion, two hundred thirty-five million, six hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •