Base | Representation |
---|---|
bin | 1101001000111000110… |
… | …1110000111000010111 |
3 | 210120122010001002220211 |
4 | 3102032031300320113 |
5 | 12144240403202101 |
6 | 251410222310251 |
7 | 22210441441000 |
oct | 3221615607027 |
9 | 716563032824 |
10 | 225724272151 |
11 | 87802515654 |
12 | 378b6728387 |
13 | 183939128a1 |
14 | acd47201a7 |
15 | 5d11a10c51 |
hex | 348e370e17 |
225724272151 has 8 divisors (see below), whose sum is σ = 263235303200. Its totient is φ = 193477947264.
The previous prime is 225724272121. The next prime is 225724272161. The reversal of 225724272151 is 151272427522.
225724272151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 225724272151 - 29 = 225724271639 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 (225724272121) 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, 329043786 + ... + 329044471.
It is an arithmetic number, because the mean of its divisors is an integer number (32904412900).
Almost surely, 2225724272151 is an apocalyptic number.
225724272151 is a deficient number, since it is larger than the sum of its proper divisors (37511031049).
225724272151 is an frugal number, since it uses more digits than its factorization.
225724272151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 658088278 (or 658088264 counting only the distinct ones).
The product of its digits is 156800, while the sum is 40.
Adding to 225724272151 its reverse (151272427522), we get a palindrome (376996699673).
The spelling of 225724272151 in words is "two hundred twenty-five billion, seven hundred twenty-four million, two hundred seventy-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •