Base | Representation |
---|---|
bin | 1100010110010101110… |
… | …11010100100011010001 |
3 | 1111120012222122120102112 |
4 | 12023022323110203101 |
5 | 23422442200441223 |
6 | 522532000355105 |
7 | 42440554623644 |
oct | 6131273244321 |
9 | 1446188576375 |
10 | 424311343313 |
11 | 153a49767470 |
12 | 6a299015a95 |
13 | 310212a75a0 |
14 | 16772cc5a5b |
15 | b085dd9778 |
hex | 62caed48d1 |
424311343313 has 16 divisors (see below), whose sum is σ = 505512669312. Its totient is φ = 351050448000.
The previous prime is 424311343301. The next prime is 424311343343. The reversal of 424311343313 is 313343113424.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 424311343313 - 26 = 424311343249 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 424311343313.
It is not an unprimeable number, because it can be changed into a prime (424311343343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20885708 + ... + 20906013.
It is an arithmetic number, because the mean of its divisors is an integer number (31594541832).
Almost surely, 2424311343313 is an apocalyptic number.
It is an amenable number.
424311343313 is a deficient number, since it is larger than the sum of its proper divisors (81201325999).
424311343313 is a wasteful number, since it uses less digits than its factorization.
424311343313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41791816.
The product of its digits is 31104, while the sum is 32.
Adding to 424311343313 its reverse (313343113424), we get a palindrome (737654456737).
The spelling of 424311343313 in words is "four hundred twenty-four billion, three hundred eleven million, three hundred forty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •