Base | Representation |
---|---|
bin | 1100000011001010011… |
… | …11111111101010000011 |
3 | 1110120122110022012002012 |
4 | 12001211033333222003 |
5 | 23240400440132011 |
6 | 514110210043135 |
7 | 41624456062016 |
oct | 6014517775203 |
9 | 1416573265065 |
10 | 414015552131 |
11 | 14a645a93135 |
12 | 682a4b794ab |
13 | 30070233c5c |
14 | 1607776737d |
15 | ab8209ea8b |
hex | 60653ffa83 |
414015552131 has 2 divisors, whose sum is σ = 414015552132. Its totient is φ = 414015552130.
The previous prime is 414015552113. The next prime is 414015552143. The reversal of 414015552131 is 131255510414.
Together with previous prime (414015552113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 414015552131 - 210 = 414015551107 is a prime.
It is a super-2 number, since 2×4140155521312 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (414015552031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 207007776065 + 207007776066.
It is an arithmetic number, because the mean of its divisors is an integer number (207007776066).
Almost surely, 2414015552131 is an apocalyptic number.
414015552131 is a deficient number, since it is larger than the sum of its proper divisors (1).
414015552131 is an equidigital number, since it uses as much as digits as its factorization.
414015552131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12000, while the sum is 32.
The spelling of 414015552131 in words is "four hundred fourteen billion, fifteen million, five hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •