Base | Representation |
---|---|
bin | 110000010111100100000111… |
… | …0011011100001110001111101 |
3 | 2001210101201200112121101000202 |
4 | 1200233020032123201301331 |
5 | 421231042334300120240 |
6 | 4104505313132133245 |
7 | 155420554116516356 |
oct | 14057101633416175 |
9 | 2053351615541022 |
10 | 425451112504445 |
11 | 11361a8925806a5 |
12 | 3b873338907225 |
13 | 15351b38612241 |
14 | 770bd2d7b6d2d |
15 | 342be5e47a315 |
hex | 182f20e6e1c7d |
425451112504445 has 16 divisors (see below), whose sum is σ = 533007980588160. Its totient is φ = 325398081628224.
The previous prime is 425451112504349. The next prime is 425451112504447. The reversal of 425451112504445 is 544405211154524.
It is a de Polignac number, because none of the positive numbers 2k-425451112504445 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 425451112504445.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (425451112504447) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 934480574 + ... + 934935743.
It is an arithmetic number, because the mean of its divisors is an integer number (33312998786760).
Almost surely, 2425451112504445 is an apocalyptic number.
It is an amenable number.
425451112504445 is a deficient number, since it is larger than the sum of its proper divisors (107556868083715).
425451112504445 is a wasteful number, since it uses less digits than its factorization.
425451112504445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1869418324.
The product of its (nonzero) digits is 2560000, while the sum is 47.
Adding to 425451112504445 its reverse (544405211154524), we get a palindrome (969856323658969).
The spelling of 425451112504445 in words is "four hundred twenty-five trillion, four hundred fifty-one billion, one hundred twelve million, five hundred four thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •