Base | Representation |
---|---|
bin | 111101100000110011001… |
… | …010111001111111000001 |
3 | 112222002220022021220220112 |
4 | 331200303022321333001 |
5 | 1023224103204104400 |
6 | 12553523354321105 |
7 | 614253430563122 |
oct | 75406312717701 |
9 | 15862808256815 |
10 | 4227106316225 |
11 | 138a784351401 |
12 | 5832a9429195 |
13 | 2487cab40b80 |
14 | 10884341a049 |
15 | 74e53eb5835 |
hex | 3d8332b9fc1 |
4227106316225 has 12 divisors (see below), whose sum is σ = 5644812742716. Its totient is φ = 3121555433280.
The previous prime is 4227106316201. The next prime is 4227106316227. The reversal of 4227106316225 is 5226136017224.
It can be written as a sum of positive squares in 6 ways, for example, as 266375041 + 4226839941184 = 16321^2 + 2055928^2 .
It is not a de Polignac number, because 4227106316225 - 218 = 4227106054081 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4227106316227) 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 11 ways as a sum of consecutive naturals, for example, 6503240162 + ... + 6503240811.
It is an arithmetic number, because the mean of its divisors is an integer number (470401061893).
Almost surely, 24227106316225 is an apocalyptic number.
It is an amenable number.
4227106316225 is a deficient number, since it is larger than the sum of its proper divisors (1417706426491).
4227106316225 is a wasteful number, since it uses less digits than its factorization.
4227106316225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13006480996 (or 13006480991 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 41.
The spelling of 4227106316225 in words is "four trillion, two hundred twenty-seven billion, one hundred six million, three hundred sixteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •