Base | Representation |
---|---|
bin | 110011001011000011111100… |
… | …000001000101000000110001 |
3 | 1002111212120112012211100012000 |
4 | 303023003330001011000301 |
5 | 213444342413144422010 |
6 | 2114355212322524213 |
7 | 65256041232423105 |
oct | 6313037401050061 |
9 | 1074776465740160 |
10 | 225060514451505 |
11 | 657906a0101a37 |
12 | 212aa29ab06669 |
13 | 9877166838c15 |
14 | 3d80db6555905 |
15 | 1b045191197c0 |
hex | ccb0fc045031 |
225060514451505 has 128 divisors (see below), whose sum is σ = 425350808064000. Its totient is φ = 112516975521792.
The previous prime is 225060514451483. The next prime is 225060514451651. The reversal of 225060514451505 is 505154415060522.
It is a happy number.
225060514451505 is a `hidden beast` number, since 2 + 2 + 5 + 0 + 6 + 0 + 51 + 44 + 51 + 505 = 666.
It is not a de Polignac number, because 225060514451505 - 28 = 225060514451249 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 691061367 + ... + 691386963.
It is an arithmetic number, because the mean of its divisors is an integer number (3323053188000).
Almost surely, 2225060514451505 is an apocalyptic number.
It is an amenable number.
225060514451505 is a deficient number, since it is larger than the sum of its proper divisors (200290293612495).
225060514451505 is a wasteful number, since it uses less digits than its factorization.
225060514451505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326840 (or 326834 counting only the distinct ones).
The product of its (nonzero) digits is 1200000, while the sum is 45.
The spelling of 225060514451505 in words is "two hundred twenty-five trillion, sixty billion, five hundred fourteen million, four hundred fifty-one thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •