Base | Representation |
---|---|
bin | 1100010101111110011… |
… | …11100101110111010001 |
3 | 1111112201022211002102012 |
4 | 12022333033211313101 |
5 | 23422042011034023 |
6 | 522500315232305 |
7 | 42432654554030 |
oct | 6127717456721 |
9 | 1445638732365 |
10 | 424115330513 |
11 | 153959058116 |
12 | 6a243448695 |
13 | 30cbc7b8094 |
14 | 16754c60717 |
15 | b073abb978 |
hex | 62bf3e5dd1 |
424115330513 has 4 divisors (see below), whose sum is σ = 484703234880. Its totient is φ = 363527426148.
The previous prime is 424115330477. The next prime is 424115330579. The reversal of 424115330513 is 315033511424.
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 424115330513 - 216 = 424115264977 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 424115330513.
It is not an unprimeable number, because it can be changed into a prime (424115330113) 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, 30293952173 + ... + 30293952186.
It is an arithmetic number, because the mean of its divisors is an integer number (121175808720).
Almost surely, 2424115330513 is an apocalyptic number.
It is an amenable number.
424115330513 is a deficient number, since it is larger than the sum of its proper divisors (60587904367).
424115330513 is an equidigital number, since it uses as much as digits as its factorization.
424115330513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60587904366.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 424115330513 its reverse (315033511424), we get a palindrome (739148841937).
The spelling of 424115330513 in words is "four hundred twenty-four billion, one hundred fifteen million, three hundred thirty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •