Base | Representation |
---|---|
bin | 110000010101010101101000… |
… | …1110001110011010010001001 |
3 | 2001202022110221122102022021101 |
4 | 1200222223101301303102021 |
5 | 421211034232434130423 |
6 | 4104112553042141401 |
7 | 155356503126354553 |
oct | 14052532161632211 |
9 | 2052273848368241 |
10 | 425145152255113 |
11 | 113512056a33904 |
12 | 3b823b8b351861 |
13 | 1532c028a24aa4 |
14 | 76db1c6c524d3 |
15 | 34240038d67ad |
hex | 182aad1c73489 |
425145152255113 has 4 divisors (see below), whose sum is σ = 425145911844420. Its totient is φ = 425144392665808.
The previous prime is 425145152255017. The next prime is 425145152255137. The reversal of 425145152255113 is 311552251541524.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14078164359744 + 411066987895369 = 3752088^2 + 20274787^2 .
It is a cyclic number.
It is not a de Polignac number, because 425145152255113 - 229 = 425144615384201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (425145152235113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 378954478 + ... + 380074711.
It is an arithmetic number, because the mean of its divisors is an integer number (106286477961105).
Almost surely, 2425145152255113 is an apocalyptic number.
It is an amenable number.
425145152255113 is a deficient number, since it is larger than the sum of its proper divisors (759589307).
425145152255113 is an equidigital number, since it uses as much as digits as its factorization.
425145152255113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 759589306.
The product of its digits is 1200000, while the sum is 46.
The spelling of 425145152255113 in words is "four hundred twenty-five trillion, one hundred forty-five billion, one hundred fifty-two million, two hundred fifty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •