Base | Representation |
---|---|
bin | 100100100000111… |
… | …1100001010100000 |
3 | 10011101111220122012 |
4 | 1021001330022200 |
5 | 10002130322334 |
6 | 321325132052 |
7 | 42235261601 |
oct | 11101741240 |
9 | 3141456565 |
10 | 1225245344 |
11 | 579689a64 |
12 | 2a23ba028 |
13 | 166ac325b |
14 | b8a21da8 |
15 | 728759ce |
hex | 4907c2a0 |
1225245344 has 12 divisors (see below), whose sum is σ = 2412201834. Its totient is φ = 612622656.
The previous prime is 1225245341. The next prime is 1225245401. The reversal of 1225245344 is 4435425221.
It can be written as a sum of positive squares in only one way, i.e., 715027600 + 510217744 = 26740^2 + 22588^2 .
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 38288917 = 1225245344 / (1 + 2 + 2 + 5 + 2 + 4 + 5 + 3 + 4 + 4).
It is a self number, because there is not a number n which added to its sum of digits gives 1225245344.
It is not an unprimeable number, because it can be changed into a prime (1225245341) 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 as a sum of consecutive naturals, namely, 19144427 + ... + 19144490.
Almost surely, 21225245344 is an apocalyptic number.
It is an amenable number.
1225245344 is a deficient number, since it is larger than the sum of its proper divisors (1186956490).
1225245344 is an equidigital number, since it uses as much as digits as its factorization.
1225245344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38288927 (or 38288919 counting only the distinct ones).
The product of its digits is 38400, while the sum is 32.
The square root of 1225245344 is about 35003.5047388115. The cubic root of 1225245344 is about 1070.0589084521.
The spelling of 1225245344 in words is "one billion, two hundred twenty-five million, two hundred forty-five thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •