Base | Representation |
---|---|
bin | 11111011000010110001… |
… | …010011011011100111001 |
3 | 21122011011101111101100001 |
4 | 133120112022123130321 |
5 | 240312400011241400 |
6 | 4330353553113001 |
7 | 311540504410243 |
oct | 37302612333471 |
9 | 7564141441301 |
10 | 2156445415225 |
11 | 7615a8244882 |
12 | 2a9b25258761 |
13 | 12847626249a |
14 | 76530277093 |
15 | 3b162879a6a |
hex | 1f61629b739 |
2156445415225 has 12 divisors (see below), whose sum is σ = 2682427631724. Its totient is φ = 1719714192320.
The previous prime is 2156445415207. The next prime is 2156445415231. The reversal of 2156445415225 is 5225145446512.
It can be written as a sum of positive squares in 6 ways, for example, as 23855420304 + 2132589994921 = 154452^2 + 1460339^2 .
It is a de Polignac number, because none of the positive numbers 2k-2156445415225 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 136045414 + ... + 136061263.
It is an arithmetic number, because the mean of its divisors is an integer number (223535635977).
Almost surely, 22156445415225 is an apocalyptic number.
2156445415225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2156445415225 is a deficient number, since it is larger than the sum of its proper divisors (525982216499).
2156445415225 is a wasteful number, since it uses less digits than its factorization.
2156445415225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272107004 (or 272106999 counting only the distinct ones).
The product of its digits is 1920000, while the sum is 46.
The spelling of 2156445415225 in words is "two trillion, one hundred fifty-six billion, four hundred forty-five million, four hundred fifteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •