Base | Representation |
---|---|
bin | 1100000011111100000… |
… | …01110000111010100011 |
3 | 1110121201102111221021111 |
4 | 12001332001300322203 |
5 | 23242223400032011 |
6 | 514215340004151 |
7 | 41640664343251 |
oct | 6017601607243 |
9 | 1417642457244 |
10 | 414431252131 |
11 | 14a839701756 |
12 | 683a0230657 |
13 | 301083b16a0 |
14 | 160b6a575d1 |
15 | aba8815121 |
hex | 607e070ea3 |
414431252131 has 4 divisors (see below), whose sum is σ = 446310579232. Its totient is φ = 382551925032.
The previous prime is 414431252129. The next prime is 414431252153. The reversal of 414431252131 is 131252134414.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 414431252131 - 21 = 414431252129 is a prime.
It is a super-2 number, since 2×4144312521312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 414431252093 and 414431252102.
It is not an unprimeable number, because it can be changed into a prime (414431252101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15939663531 + ... + 15939663556.
It is an arithmetic number, because the mean of its divisors is an integer number (111577644808).
Almost surely, 2414431252131 is an apocalyptic number.
414431252131 is a deficient number, since it is larger than the sum of its proper divisors (31879327101).
414431252131 is a wasteful number, since it uses less digits than its factorization.
414431252131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31879327100.
The product of its digits is 11520, while the sum is 31.
Adding to 414431252131 its reverse (131252134414), we get a palindrome (545683386545).
The spelling of 414431252131 in words is "four hundred fourteen billion, four hundred thirty-one million, two hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •