Base | Representation |
---|---|
bin | 1100000011100111000… |
… | …11111000010110100000 |
3 | 1110121021012002020002212 |
4 | 12001303203320112200 |
5 | 23241343421133422 |
6 | 514150104101252 |
7 | 41633432615330 |
oct | 6016343702640 |
9 | 1417235066085 |
10 | 414255646112 |
11 | 14a759570310 |
12 | 68351464828 |
13 | 300aabb87b9 |
14 | 1609b5c50c0 |
15 | ab981c89e2 |
hex | 60738f85a0 |
414255646112 has 96 divisors (see below), whose sum is σ = 1017069903360. Its totient is φ = 161356942080.
The previous prime is 414255646001. The next prime is 414255646139. The reversal of 414255646112 is 211646552414.
It is a self number, because there is not a number n which added to its sum of digits gives 414255646112.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10671923 + ... + 10710669.
It is an arithmetic number, because the mean of its divisors is an integer number (10594478160).
Almost surely, 2414255646112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 414255646112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (508534951680).
414255646112 is an abundant number, since it is smaller than the sum of its proper divisors (602814257248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
414255646112 is a wasteful number, since it uses less digits than its factorization.
414255646112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43114 (or 43106 counting only the distinct ones).
The product of its digits is 230400, while the sum is 41.
The spelling of 414255646112 in words is "four hundred fourteen billion, two hundred fifty-five million, six hundred forty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •