Base | Representation |
---|---|
bin | 1100000011001010010… |
… | …10001010111000010001 |
3 | 1110120122100102121120102 |
4 | 12001211022022320101 |
5 | 23240400042301413 |
6 | 514110113222145 |
7 | 41624440102304 |
oct | 6014512127021 |
9 | 1416570377512 |
10 | 414014025233 |
11 | 14a64513aa36 |
12 | 682a4561955 |
13 | 3006cb1ac73 |
14 | 1607748ab3b |
15 | ab81d9c458 |
hex | 606528ae11 |
414014025233 has 2 divisors, whose sum is σ = 414014025234. Its totient is φ = 414014025232.
The previous prime is 414014025221. The next prime is 414014025263. The reversal of 414014025233 is 332520410414.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 381143247424 + 32870777809 = 617368^2 + 181303^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-414014025233 is a prime.
It is a super-2 number, since 2×4140140252332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 414014025196 and 414014025205.
It is not a weakly prime, because it can be changed into another prime (414014025263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 207007012616 + 207007012617.
It is an arithmetic number, because the mean of its divisors is an integer number (207007012617).
Almost surely, 2414014025233 is an apocalyptic number.
It is an amenable number.
414014025233 is a deficient number, since it is larger than the sum of its proper divisors (1).
414014025233 is an equidigital number, since it uses as much as digits as its factorization.
414014025233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 414014025233 its reverse (332520410414), we get a palindrome (746534435647).
The spelling of 414014025233 in words is "four hundred fourteen billion, fourteen million, twenty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •