Base | Representation |
---|---|
bin | 1101001110110011101… |
… | …1100001001001100001 |
3 | 210201201212010100010202 |
4 | 3103230323201021201 |
5 | 12211014202342031 |
6 | 252232025234545 |
7 | 22265015244044 |
oct | 3235473411141 |
9 | 721655110122 |
10 | 227313324641 |
11 | 8844849a277 |
12 | 3807a932a55 |
13 | 18587bb4730 |
14 | b0057a4c5b |
15 | 5da629b2cb |
hex | 34ecee1261 |
227313324641 has 16 divisors (see below), whose sum is σ = 250758742080. Its totient is φ = 204729698880.
The previous prime is 227313324619. The next prime is 227313324659. The reversal of 227313324641 is 146423313722.
227313324641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 227313324641 - 26 = 227313324577 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 227313324595 and 227313324604.
It is not an unprimeable number, because it can be changed into a prime (227313324691) 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 15 ways as a sum of consecutive naturals, for example, 309950 + ... + 742088.
It is an arithmetic number, because the mean of its divisors is an integer number (15672421380).
Almost surely, 2227313324641 is an apocalyptic number.
It is an amenable number.
227313324641 is a deficient number, since it is larger than the sum of its proper divisors (23445417439).
227313324641 is a wasteful number, since it uses less digits than its factorization.
227313324641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433136.
The product of its digits is 145152, while the sum is 38.
The spelling of 227313324641 in words is "two hundred twenty-seven billion, three hundred thirteen million, three hundred twenty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •