Base | Representation |
---|---|
bin | 110000000001100011001100… |
… | …1111101100000100000001011 |
3 | 2001101200111001111201100020012 |
4 | 1200003012121331200200023 |
5 | 420332004411341021301 |
6 | 4054231332452022135 |
7 | 154656143502364130 |
oct | 14003063175404013 |
9 | 2041614044640205 |
10 | 422425501501451 |
11 | 112663715a95348 |
12 | 3b464a8590194b |
13 | 15192727ac9cc6 |
14 | 7645709328587 |
15 | 33c83cb5c0ebb |
hex | 1803199f6080b |
422425501501451 has 16 divisors (see below), whose sum is σ = 503765689027584. Its totient is φ = 346333960821024.
The previous prime is 422425501501441. The next prime is 422425501501457. The reversal of 422425501501451 is 154105105524224.
It is a cyclic number.
It is not a de Polignac number, because 422425501501451 - 226 = 422425434392587 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 422425501501399 and 422425501501408.
It is not an unprimeable number, because it can be changed into a prime (422425501501457) 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, 13393025 + ... + 32003501.
It is an arithmetic number, because the mean of its divisors is an integer number (31485355564224).
Almost surely, 2422425501501451 is an apocalyptic number.
422425501501451 is a deficient number, since it is larger than the sum of its proper divisors (81340187526133).
422425501501451 is a wasteful number, since it uses less digits than its factorization.
422425501501451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18751490.
The product of its (nonzero) digits is 320000, while the sum is 41.
The spelling of 422425501501451 in words is "four hundred twenty-two trillion, four hundred twenty-five billion, five hundred one million, five hundred one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •