Base | Representation |
---|---|
bin | 111110111001000… |
… | …100010100111101 |
3 | 2201112110001000120 |
4 | 332321010110331 |
5 | 4130104203300 |
6 | 252411245153 |
7 | 35101414161 |
oct | 7671042475 |
9 | 2645401016 |
10 | 1055147325 |
11 | 4a166a891 |
12 | 2554497b9 |
13 | 13a7a843b |
14 | a01c4ca1 |
15 | 629763a0 |
hex | 3ee4453d |
1055147325 has 12 divisors (see below), whose sum is σ = 1744510368. Its totient is φ = 562745200.
The previous prime is 1055147323. The next prime is 1055147351. The reversal of 1055147325 is 5237415501.
It is not a de Polignac number, because 1055147325 - 21 = 1055147323 is a prime.
It is a super-2 number, since 2×10551473252 = 2226671754909311250, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055147323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7034241 + ... + 7034390.
It is an arithmetic number, because the mean of its divisors is an integer number (145375864).
Almost surely, 21055147325 is an apocalyptic number.
1055147325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1055147325 is a deficient number, since it is larger than the sum of its proper divisors (689363043).
1055147325 is a wasteful number, since it uses less digits than its factorization.
1055147325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14068644 (or 14068639 counting only the distinct ones).
The product of its (nonzero) digits is 21000, while the sum is 33.
The square root of 1055147325 is about 32483.0313394548. The cubic root of 1055147325 is about 1018.0545144581.
The spelling of 1055147325 in words is "one billion, fifty-five million, one hundred forty-seven thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •