Base | Representation |
---|---|
bin | 1100000011010100101… |
… | …10111000010010000010 |
3 | 1110120212102112201212110 |
4 | 12001222112320102002 |
5 | 23241034404234020 |
6 | 514122510440150 |
7 | 41626546326450 |
oct | 6015226702202 |
9 | 1416772481773 |
10 | 414101243010 |
11 | 14a68a3a0a44 |
12 | 68309803056 |
13 | 30084c07710 |
14 | 16084cb19d0 |
15 | ab898798e0 |
hex | 606a5b8482 |
414101243010 has 256 divisors, whose sum is σ = 1287691001856. Its totient is φ = 82831085568.
The previous prime is 414101242993. The next prime is 414101243027. The reversal of 414101243010 is 10342101414.
It is an interprime number because it is at equal distance from previous prime (414101242993) and next prime (414101243027).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 7066089 + ... + 7124451.
It is an arithmetic number, because the mean of its divisors is an integer number (5030042976).
Almost surely, 2414101243010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 414101243010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (643845500928).
414101243010 is an abundant number, since it is smaller than the sum of its proper divisors (873589758846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
414101243010 is a wasteful number, since it uses less digits than its factorization.
414101243010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58529.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 414101243010 its reverse (10342101414), we get a palindrome (424443344424).
The spelling of 414101243010 in words is "four hundred fourteen billion, one hundred one million, two hundred forty-three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •