Base | Representation |
---|---|
bin | 100010010111010010110011… |
… | …000110100001111100101001 |
3 | 201211010022002012110200001012 |
4 | 202113102303012201330221 |
5 | 124302141033343421400 |
6 | 1253234051222433305 |
7 | 43556044123101200 |
oct | 4227226306417451 |
9 | 654108065420035 |
10 | 151134314045225 |
11 | 44179780240315 |
12 | 14b4aa13b92835 |
13 | 6643b9b705654 |
14 | 2946d22c70237 |
15 | 127153c614d35 |
hex | 8974b31a1f29 |
151134314045225 has 144 divisors (see below), whose sum is σ = 226102050060480. Its totient is φ = 99803795212800.
The previous prime is 151134314045219. The next prime is 151134314045227. The reversal of 151134314045225 is 522540413431151.
It is not a de Polignac number, because 151134314045225 - 28 = 151134314044969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (151134314045227) 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 143 ways as a sum of consecutive naturals, for example, 36943120430 + ... + 36943124520.
It is an arithmetic number, because the mean of its divisors is an integer number (1570153125420).
Almost surely, 2151134314045225 is an apocalyptic number.
It is an amenable number.
151134314045225 is a deficient number, since it is larger than the sum of its proper divisors (74967736015255).
151134314045225 is a wasteful number, since it uses less digits than its factorization.
151134314045225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6568 (or 6556 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 41.
Adding to 151134314045225 its reverse (522540413431151), we get a palindrome (673674727476376).
The spelling of 151134314045225 in words is "one hundred fifty-one trillion, one hundred thirty-four billion, three hundred fourteen million, forty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •