Base | Representation |
---|---|
bin | 1100000011100101100… |
… | …11101011110111000001 |
3 | 1110121020022022100102000 |
4 | 12001302303223313001 |
5 | 23241332202341113 |
6 | 514144533214213 |
7 | 41633220335304 |
oct | 6016263536701 |
9 | 1417208270360 |
10 | 414243012033 |
11 | 14a752421124 |
12 | 68349191369 |
13 | 300a83b4006 |
14 | 16099a56b3b |
15 | ab97030373 |
hex | 6072cebdc1 |
414243012033 has 32 divisors (see below), whose sum is σ = 619589347200. Its totient is φ = 273510151488.
The previous prime is 414243012023. The next prime is 414243012037. The reversal of 414243012033 is 330210342414.
414243012033 is a `hidden beast` number, since 4 + 1 + 424 + 30 + 1 + 203 + 3 = 666.
It is not a de Polignac number, because 414243012033 - 216 = 414242946497 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 414243011988 and 414243012006.
It is not an unprimeable number, because it can be changed into a prime (414243012037) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12617203 + ... + 12649991.
It is an arithmetic number, because the mean of its divisors is an integer number (19362167100).
Almost surely, 2414243012033 is an apocalyptic number.
It is an amenable number.
414243012033 is a deficient number, since it is larger than the sum of its proper divisors (205346335167).
414243012033 is a wasteful number, since it uses less digits than its factorization.
414243012033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37278 (or 37272 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 414243012033 its reverse (330210342414), we get a palindrome (744453354447).
The spelling of 414243012033 in words is "four hundred fourteen billion, two hundred forty-three million, twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •