Base | Representation |
---|---|
bin | 1100000111000111110… |
… | …01000010010010100101 |
3 | 1110210010112021111221212 |
4 | 12003203321002102211 |
5 | 23304223400140122 |
6 | 515101105321205 |
7 | 42031225451264 |
oct | 6034371022245 |
9 | 1423115244855 |
10 | 416140240037 |
11 | 150536353655 |
12 | 68798636205 |
13 | 3031b486c32 |
14 | 161d99dc5db |
15 | ac58891ce2 |
hex | 60e3e424a5 |
416140240037 has 2 divisors, whose sum is σ = 416140240038. Its totient is φ = 416140240036.
The previous prime is 416140240031. The next prime is 416140240049. The reversal of 416140240037 is 730042041614.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 414672890401 + 1467349636 = 643951^2 + 38306^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-416140240037 is a prime.
It is a super-2 number, since 2×4161402400372 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 416140239985 and 416140240012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (416140240031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 208070120018 + 208070120019.
It is an arithmetic number, because the mean of its divisors is an integer number (208070120019).
Almost surely, 2416140240037 is an apocalyptic number.
It is an amenable number.
416140240037 is a deficient number, since it is larger than the sum of its proper divisors (1).
416140240037 is an equidigital number, since it uses as much as digits as its factorization.
416140240037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 32.
The spelling of 416140240037 in words is "four hundred sixteen billion, one hundred forty million, two hundred forty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •