Base | Representation |
---|---|
bin | 1100000011001010000… |
… | …10011111101110001101 |
3 | 1110120122012122101221001 |
4 | 12001211002133232031 |
5 | 23240344033412303 |
6 | 514110002140301 |
7 | 41624414023123 |
oct | 6014502375615 |
9 | 1416565571831 |
10 | 414012013453 |
11 | 14a643a96505 |
12 | 682a3951691 |
13 | 3006c59536c |
14 | 160770c5913 |
15 | ab81b0131d |
hex | 606509fb8d |
414012013453 has 2 divisors, whose sum is σ = 414012013454. Its totient is φ = 414012013452.
The previous prime is 414012013403. The next prime is 414012013469. The reversal of 414012013453 is 354310210414.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 375129300484 + 38882712969 = 612478^2 + 197187^2 .
It is a cyclic number.
It is not a de Polignac number, because 414012013453 - 221 = 414009916301 is a prime.
It is a super-3 number, since 3×4140120134533 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (414012013403) 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 as a sum of consecutive naturals, namely, 207006006726 + 207006006727.
It is an arithmetic number, because the mean of its divisors is an integer number (207006006727).
Almost surely, 2414012013453 is an apocalyptic number.
It is an amenable number.
414012013453 is a deficient number, since it is larger than the sum of its proper divisors (1).
414012013453 is an equidigital number, since it uses as much as digits as its factorization.
414012013453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 414012013453 its reverse (354310210414), we get a palindrome (768322223867).
The spelling of 414012013453 in words is "four hundred fourteen billion, twelve million, thirteen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •