Base | Representation |
---|---|
bin | 1100000001100001001… |
… | …11001100011101010111 |
3 | 1110111100220120111221111 |
4 | 12000300213030131113 |
5 | 23232043401111211 |
6 | 513442421555451 |
7 | 41563543545163 |
oct | 6006047143527 |
9 | 1414326514844 |
10 | 413132441431 |
11 | 14a232546a86 |
12 | 68099275b87 |
13 | 2cc5c2a1b48 |
14 | 15dd2365ca3 |
15 | ab2e7ac421 |
hex | 60309cc757 |
413132441431 has 8 divisors (see below), whose sum is σ = 418933775520. Its totient is φ = 407365537152.
The previous prime is 413132441417. The next prime is 413132441441. The reversal of 413132441431 is 134144231314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 413132441431 - 221 = 413130344279 is a prime.
It is a super-2 number, since 2×4131324414312 (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 = 413132441393 and 413132441402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413132441441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8583286 + ... + 8631283.
It is an arithmetic number, because the mean of its divisors is an integer number (52366721940).
Almost surely, 2413132441431 is an apocalyptic number.
413132441431 is a deficient number, since it is larger than the sum of its proper divisors (5801334089).
413132441431 is a wasteful number, since it uses less digits than its factorization.
413132441431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17214905.
The product of its digits is 13824, while the sum is 31.
Adding to 413132441431 its reverse (134144231314), we get a palindrome (547276672745).
The spelling of 413132441431 in words is "four hundred thirteen billion, one hundred thirty-two million, four hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •