Base | Representation |
---|---|
bin | 10100110010101100111… |
… | …01011100111100000101 |
3 | 2112022000211002222221022 |
4 | 22121112131130330011 |
5 | 43201110233214141 |
6 | 1304110415400525 |
7 | 102420605300444 |
oct | 12312635347405 |
9 | 2468024088838 |
10 | 714415132421 |
11 | 255a88798a81 |
12 | b6560223145 |
13 | 524a4a880b3 |
14 | 268139a0d5b |
15 | 138b488cb4b |
hex | a65675cf05 |
714415132421 has 4 divisors (see below), whose sum is σ = 714484862112. Its totient is φ = 714345402732.
The previous prime is 714415132397. The next prime is 714415132427. The reversal of 714415132421 is 124231514417.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 714415132421 - 234 = 697235263237 is a prime.
It is a super-2 number, since 2×7144151324212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (714415132427) 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, 34849475 + ... + 34869968.
It is an arithmetic number, because the mean of its divisors is an integer number (178621215528).
Almost surely, 2714415132421 is an apocalyptic number.
It is an amenable number.
714415132421 is a deficient number, since it is larger than the sum of its proper divisors (69729691).
714415132421 is a wasteful number, since it uses less digits than its factorization.
714415132421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69729690.
The product of its digits is 26880, while the sum is 35.
Adding to 714415132421 its reverse (124231514417), we get a palindrome (838646646838).
The spelling of 714415132421 in words is "seven hundred fourteen billion, four hundred fifteen million, one hundred thirty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •