Base | Representation |
---|---|
bin | 100100100001010… |
… | …0010101001111001 |
3 | 10011101210220220100 |
4 | 1021002202221321 |
5 | 10002200344001 |
6 | 321332350013 |
7 | 42236516334 |
oct | 11102425171 |
9 | 3141726810 |
10 | 1225403001 |
11 | 579787459 |
12 | 2a2475309 |
13 | 166b49c44 |
14 | b8a6361b |
15 | 728a7586 |
hex | 490a2a79 |
1225403001 has 24 divisors (see below), whose sum is σ = 1782196416. Its totient is φ = 811340640.
The previous prime is 1225402991. The next prime is 1225403021. The reversal of 1225403001 is 1003045221.
1225403001 is a `hidden beast` number, since 122 + 540 + 3 + 0 + 0 + 1 = 666.
It is not a de Polignac number, because 1225403001 - 222 = 1221208697 is a prime.
It is a super-2 number, since 2×12254030012 = 3003225029719612002, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1225403021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1090626 + ... + 1091748.
It is an arithmetic number, because the mean of its divisors is an integer number (74258184).
Almost surely, 21225403001 is an apocalyptic number.
It is an amenable number.
1225403001 is a deficient number, since it is larger than the sum of its proper divisors (556793415).
1225403001 is a wasteful number, since it uses less digits than its factorization.
1225403001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1853 (or 1850 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 1225403001 is about 35005.7566837228. The cubic root of 1225403001 is about 1070.1048026732.
Adding to 1225403001 its reverse (1003045221), we get a palindrome (2228448222).
The spelling of 1225403001 in words is "one billion, two hundred twenty-five million, four hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •