Base | Representation |
---|---|
bin | 100100100001100… |
… | …0111100001111001 |
3 | 10011102002121002102 |
4 | 1021003013201321 |
5 | 10002220212131 |
6 | 321335513145 |
7 | 42241015565 |
oct | 11103074171 |
9 | 3142077072 |
10 | 1225554041 |
11 | 57987a988 |
12 | 2a25287b5 |
13 | 166ba090a |
14 | b8aa26a5 |
15 | 728d71cb |
hex | 490c7879 |
1225554041 has 2 divisors, whose sum is σ = 1225554042. Its totient is φ = 1225554040.
The previous prime is 1225554023. The next prime is 1225554059. The reversal of 1225554041 is 1404555221.
It is a balanced prime because it is at equal distance from previous prime (1225554023) and next prime (1225554059).
It can be written as a sum of positive squares in only one way, i.e., 1090320400 + 135233641 = 33020^2 + 11629^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1225554041 is a prime.
It is a super-2 number, since 2×12255540412 = 3003965414822859362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1225553995 and 1225554013.
It is not a weakly prime, because it can be changed into another prime (1225554061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 612777020 + 612777021.
It is an arithmetic number, because the mean of its divisors is an integer number (612777021).
Almost surely, 21225554041 is an apocalyptic number.
It is an amenable number.
1225554041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1225554041 is an equidigital number, since it uses as much as digits as its factorization.
1225554041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8000, while the sum is 29.
The square root of 1225554041 is about 35007.9139766996. The cubic root of 1225554041 is about 1070.1487669823.
The spelling of 1225554041 in words is "one billion, two hundred twenty-five million, five hundred fifty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •