Base | Representation |
---|---|
bin | 1100000011010111001… |
… | …10010000001101110111 |
3 | 1110120220212200212021101 |
4 | 12001223212100031313 |
5 | 23241110221103143 |
6 | 514124532430531 |
7 | 41630221230454 |
oct | 6015346201567 |
9 | 1416825625241 |
10 | 414122050423 |
11 | 14a6a0112954 |
12 | 68314778447 |
13 | 300893114b3 |
14 | 1608796a82b |
15 | ab8b5d9b4d |
hex | 606b990377 |
414122050423 has 8 divisors (see below), whose sum is σ = 415015207920. Its totient is φ = 413229474240.
The previous prime is 414122050411. The next prime is 414122050457. The reversal of 414122050423 is 324050221414.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-414122050423 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 414122050391 and 414122050400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (414122050403) 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, 1296361 + ... + 1583917.
It is an arithmetic number, because the mean of its divisors is an integer number (51876900990).
Almost surely, 2414122050423 is an apocalyptic number.
414122050423 is a deficient number, since it is larger than the sum of its proper divisors (893157497).
414122050423 is a wasteful number, since it uses less digits than its factorization.
414122050423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290657.
The product of its (nonzero) digits is 7680, while the sum is 28.
Adding to 414122050423 its reverse (324050221414), we get a palindrome (738172271837).
The spelling of 414122050423 in words is "four hundred fourteen billion, one hundred twenty-two million, fifty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •