Base | Representation |
---|---|
bin | 100100100001000… |
… | …0000111110010001 |
3 | 10011101112220122201 |
4 | 1021002000332101 |
5 | 10002131440131 |
6 | 321325403201 |
7 | 42235403200 |
oct | 11102007621 |
9 | 3141486581 |
10 | 1225265041 |
11 | 5796a2840 |
12 | 2a2409501 |
13 | 166acc200 |
14 | b8a29237 |
15 | 7287b761 |
hex | 49080f91 |
1225265041 has 36 divisors (see below), whose sum is σ = 1683813744. Its totient is φ = 881244000.
The previous prime is 1225265029. The next prime is 1225265053. The reversal of 1225265041 is 1405625221.
It is an interprime number because it is at equal distance from previous prime (1225265029) and next prime (1225265053).
It is not a de Polignac number, because 1225265041 - 25 = 1225265009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1225260041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 84366 + ... + 97816.
It is an arithmetic number, because the mean of its divisors is an integer number (46772604).
Almost surely, 21225265041 is an apocalyptic number.
1225265041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1225265041 is a deficient number, since it is larger than the sum of its proper divisors (458548703).
1225265041 is a wasteful number, since it uses less digits than its factorization.
1225265041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13502 (or 13482 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 1225265041 is about 35003.7860952212. The cubic root of 1225265041 is about 1070.0646424975.
The spelling of 1225265041 in words is "one billion, two hundred twenty-five million, two hundred sixty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •