Base | Representation |
---|---|
bin | 100011110000111… |
… | …0110001101101001 |
3 | 10002122010010011212 |
4 | 1013201312031221 |
5 | 4424203231040 |
6 | 315025202505 |
7 | 41511205022 |
oct | 10741661551 |
9 | 3078103155 |
10 | 1200055145 |
11 | 566444213 |
12 | 295a90435 |
13 | 161813603 |
14 | b5545c49 |
15 | 7054bd65 |
hex | 47876369 |
1200055145 has 8 divisors (see below), whose sum is σ = 1441963080. Its totient is φ = 958779520.
The previous prime is 1200055123. The next prime is 1200055147. The reversal of 1200055145 is 5415500021.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 85229824 + 1114825321 = 9232^2 + 33389^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1200055145 - 26 = 1200055081 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1200055145.
It is not an unprimeable number, because it can be changed into a prime (1200055147) 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, 153890 + ... + 161499.
It is an arithmetic number, because the mean of its divisors is an integer number (180245385).
Almost surely, 21200055145 is an apocalyptic number.
It is an amenable number.
1200055145 is a deficient number, since it is larger than the sum of its proper divisors (241907935).
1200055145 is an equidigital number, since it uses as much as digits as its factorization.
1200055145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316155.
The product of its (nonzero) digits is 1000, while the sum is 23.
The square root of 1200055145 is about 34641.8120917483. The cubic root of 1200055145 is about 1062.6748467963.
Adding to 1200055145 its reverse (5415500021), we get a palindrome (6615555166).
The spelling of 1200055145 in words is "one billion, two hundred million, fifty-five thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •