Base | Representation |
---|---|
bin | 100010010110000… |
… | …1110101010000101 |
3 | 2222022112021102102 |
4 | 1010230032222011 |
5 | 4330011220221 |
6 | 310204521445 |
7 | 40362423065 |
oct | 10454165205 |
9 | 2868467372 |
10 | 1152445061 |
11 | 541586039 |
12 | 281b50285 |
13 | 1549b3c71 |
14 | ad0b13a5 |
15 | 6b29530b |
hex | 44b0ea85 |
1152445061 has 12 divisors (see below), whose sum is σ = 1214597088. Its totient is φ = 1091405304.
The previous prime is 1152445051. The next prime is 1152445081. The reversal of 1152445061 is 1605442511.
It is a de Polignac number, because none of the positive numbers 2k-1152445061 is a prime.
It is a Smith number, since the sum of its digits (29) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1152445051) 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 11 ways as a sum of consecutive naturals, for example, 241646 + ... + 246368.
It is an arithmetic number, because the mean of its divisors is an integer number (101216424).
Almost surely, 21152445061 is an apocalyptic number.
It is an amenable number.
1152445061 is a deficient number, since it is larger than the sum of its proper divisors (62152027).
1152445061 is an equidigital number, since it uses as much as digits as its factorization.
1152445061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4952 (or 4849 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 29.
The square root of 1152445061 is about 33947.6812315657. The cubic root of 1152445061 is about 1048.4315391200.
Adding to 1152445061 its reverse (1605442511), we get a palindrome (2757887572).
The spelling of 1152445061 in words is "one billion, one hundred fifty-two million, four hundred forty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •