Base | Representation |
---|---|
bin | 1100011010010111101… |
… | …10011011000100010001 |
3 | 1111202210201200011211120 |
4 | 12031023312123010101 |
5 | 23441404411221040 |
6 | 523530344432453 |
7 | 42545300623566 |
oct | 6151366330421 |
9 | 1452721604746 |
10 | 426474320145 |
11 | 1549596a9a25 |
12 | 6a7a1478729 |
13 | 312a7445333 |
14 | 168da28686d |
15 | b160c417d0 |
hex | 634bd9b111 |
426474320145 has 8 divisors (see below), whose sum is σ = 682358912256. Its totient is φ = 227452970736.
The previous prime is 426474320141. The next prime is 426474320147. The reversal of 426474320145 is 541023474624.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 426474320145 - 22 = 426474320141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 426474320097 and 426474320106.
It is not an unprimeable number, because it can be changed into a prime (426474320141) 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 7 ways as a sum of consecutive naturals, for example, 14215810657 + ... + 14215810686.
It is an arithmetic number, because the mean of its divisors is an integer number (85294864032).
Almost surely, 2426474320145 is an apocalyptic number.
It is an amenable number.
426474320145 is a deficient number, since it is larger than the sum of its proper divisors (255884592111).
426474320145 is a wasteful number, since it uses less digits than its factorization.
426474320145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28431621351.
The product of its (nonzero) digits is 645120, while the sum is 42.
Adding to 426474320145 its reverse (541023474624), we get a palindrome (967497794769).
The spelling of 426474320145 in words is "four hundred twenty-six billion, four hundred seventy-four million, three hundred twenty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •