Base | Representation |
---|---|
bin | 1100010110000000010… |
… | …00000011000110010011 |
3 | 1111112202100122222221022 |
4 | 12023000020003012103 |
5 | 23422104303132243 |
6 | 522502004350055 |
7 | 42433224424124 |
oct | 6130010030623 |
9 | 1445670588838 |
10 | 424130130323 |
11 | 153966446469 |
12 | 6a2483a532b |
13 | 30cc289a573 |
14 | 16756bd404b |
15 | b075041b68 |
hex | 62c0203193 |
424130130323 has 8 divisors (see below), whose sum is σ = 425347130880. Its totient is φ = 422913923200.
The previous prime is 424130130301. The next prime is 424130130353. The reversal of 424130130323 is 323031031424.
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 424130130323 - 212 = 424130126227 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 424130130292 and 424130130301.
It is not an unprimeable number, because it can be changed into a prime (424130130353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 880673 + ... + 1274301.
It is an arithmetic number, because the mean of its divisors is an integer number (53168391360).
Almost surely, 2424130130323 is an apocalyptic number.
424130130323 is a deficient number, since it is larger than the sum of its proper divisors (1217000557).
424130130323 is a wasteful number, since it uses less digits than its factorization.
424130130323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396717.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 424130130323 its reverse (323031031424), we get a palindrome (747161161747).
The spelling of 424130130323 in words is "four hundred twenty-four billion, one hundred thirty million, one hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •