Base | Representation |
---|---|
bin | 1100000011010110000… |
… | …00110010111001111001 |
3 | 1110120220012012222121021 |
4 | 12001223000302321321 |
5 | 23241100212343113 |
6 | 514123542142441 |
7 | 41630041612504 |
oct | 6015300627171 |
9 | 1416805188537 |
10 | 414112231033 |
11 | 14a695616456 |
12 | 68311421a21 |
13 | 30087283bc7 |
14 | 1608653213b |
15 | ab8a7ea48d |
hex | 606b032e79 |
414112231033 has 2 divisors, whose sum is σ = 414112231034. Its totient is φ = 414112231032.
The previous prime is 414112231021. The next prime is 414112231063. The reversal of 414112231033 is 330132211414.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 243401129449 + 170711101584 = 493357^2 + 413172^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-414112231033 is a prime.
It is a super-2 number, since 2×4141122310332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 414112230989 and 414112231007.
It is not a weakly prime, because it can be changed into another prime (414112231063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 207056115516 + 207056115517.
It is an arithmetic number, because the mean of its divisors is an integer number (207056115517).
Almost surely, 2414112231033 is an apocalyptic number.
It is an amenable number.
414112231033 is a deficient number, since it is larger than the sum of its proper divisors (1).
414112231033 is an equidigital number, since it uses as much as digits as its factorization.
414112231033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 414112231033 its reverse (330132211414), we get a palindrome (744244442447).
The spelling of 414112231033 in words is "four hundred fourteen billion, one hundred twelve million, two hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •