Base | Representation |
---|---|
bin | 100100100110001… |
… | …1110100010101101 |
3 | 10011120201020201212 |
4 | 1021030132202231 |
5 | 10003332220342 |
6 | 321504244205 |
7 | 42300615035 |
oct | 11114364255 |
9 | 3146636655 |
10 | 1228007597 |
11 | 5801a6313 |
12 | 2a3310665 |
13 | 16754c61b |
14 | b91408c5 |
15 | 72c1e182 |
hex | 4931e8ad |
1228007597 has 8 divisors (see below), whose sum is σ = 1304350776. Its totient is φ = 1152120832.
The previous prime is 1228007567. The next prime is 1228007603. The reversal of 1228007597 is 7957008221.
It can be written as a sum of positive squares in 4 ways, for example, as 14600041 + 1213407556 = 3821^2 + 34834^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1228007597 - 212 = 1228003501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1228007507) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 108548 + ... + 119325.
It is an arithmetic number, because the mean of its divisors is an integer number (163043847).
Almost surely, 21228007597 is an apocalyptic number.
1228007597 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1228007597 is a deficient number, since it is larger than the sum of its proper divisors (76343179).
1228007597 is a wasteful number, since it uses less digits than its factorization.
1228007597 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228207.
The product of its (nonzero) digits is 70560, while the sum is 41.
The square root of 1228007597 is about 35042.9393316257. The cubic root of 1228007597 is about 1070.8624359548.
The spelling of 1228007597 in words is "one billion, two hundred twenty-eight million, seven thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •