Base | Representation |
---|---|
bin | 1100000011111000011… |
… | …00000111011110100011 |
3 | 1110121122021111001221221 |
4 | 12001330030013132203 |
5 | 23242143001132210 |
6 | 514212314555511 |
7 | 41640141244114 |
oct | 6017414073643 |
9 | 1417567431857 |
10 | 414400411555 |
11 | 14a823257779 |
12 | 68391a38b97 |
13 | 30101ba3c20 |
14 | 160b290a20b |
15 | aba5c721da |
hex | 607c3077a3 |
414400411555 has 8 divisors (see below), whose sum is σ = 535532839632. Its totient is φ = 306018765408.
The previous prime is 414400411553. The next prime is 414400411561. The reversal of 414400411555 is 555114004414.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 414400411555 - 21 = 414400411553 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 414400411555.
It is not an unprimeable number, because it can be changed into a prime (414400411553) 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 7 ways as a sum of consecutive naturals, for example, 3187695409 + ... + 3187695538.
It is an arithmetic number, because the mean of its divisors is an integer number (66941604954).
Almost surely, 2414400411555 is an apocalyptic number.
414400411555 is a deficient number, since it is larger than the sum of its proper divisors (121132428077).
414400411555 is a wasteful number, since it uses less digits than its factorization.
414400411555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6375390965.
The product of its (nonzero) digits is 32000, while the sum is 34.
Adding to 414400411555 its reverse (555114004414), we get a palindrome (969514415969).
The spelling of 414400411555 in words is "four hundred fourteen billion, four hundred million, four hundred eleven thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •