Base | Representation |
---|---|
bin | 110000010100010010001100… |
… | …1000111011001110010110111 |
3 | 2001201210122010001101012201001 |
4 | 1200220210121013121302313 |
5 | 421201201123433242101 |
6 | 4103522241324544131 |
7 | 155343155062330465 |
oct | 14050443107316267 |
9 | 2051718101335631 |
10 | 425000320212151 |
11 | 11346669502a332 |
12 | 3b7bbaab3b2047 |
13 | 1531b48704c698 |
14 | 76d41a79a3835 |
15 | 3420378888901 |
hex | 18289191d9cb7 |
425000320212151 has 16 divisors (see below), whose sum is σ = 438966017297280. Its totient is φ = 411255267621120.
The previous prime is 425000320212121. The next prime is 425000320212191. The reversal of 425000320212151 is 151212023000524.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 425000320212151 - 243 = 416204227189943 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (425000320212121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 111837186 + ... + 115574896.
It is an arithmetic number, because the mean of its divisors is an integer number (27435376081080).
Almost surely, 2425000320212151 is an apocalyptic number.
425000320212151 is a deficient number, since it is larger than the sum of its proper divisors (13965697085129).
425000320212151 is a wasteful number, since it uses less digits than its factorization.
425000320212151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3767226.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 425000320212151 its reverse (151212023000524), we get a palindrome (576212343212675).
The spelling of 425000320212151 in words is "four hundred twenty-five trillion, three hundred twenty million, two hundred twelve thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •