Base | Representation |
---|---|
bin | 111110110101001… |
… | …100011111000001 |
3 | 2201110112110110220 |
4 | 332311030133001 |
5 | 4124324212121 |
6 | 252333413253 |
7 | 35056655415 |
oct | 7665143701 |
9 | 2643473426 |
10 | 1054132161 |
11 | 4a1037105 |
12 | 25503a229 |
13 | 13a511354 |
14 | 9dddcd45 |
15 | 628256c6 |
hex | 3ed4c7c1 |
1054132161 has 8 divisors (see below), whose sum is σ = 1406227680. Its totient is φ = 702395712.
The previous prime is 1054132151. The next prime is 1054132169. The reversal of 1054132161 is 1612314501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1054132161 - 25 = 1054132129 is a prime.
It is a super-2 number, since 2×10541321612 = 2222389225709059842, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1054132169) 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 7 ways as a sum of consecutive naturals, for example, 82840 + ... + 94713.
It is an arithmetic number, because the mean of its divisors is an integer number (175778460).
Almost surely, 21054132161 is an apocalyptic number.
It is an amenable number.
1054132161 is a deficient number, since it is larger than the sum of its proper divisors (352095519).
1054132161 is a wasteful number, since it uses less digits than its factorization.
1054132161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179535.
The product of its (nonzero) digits is 720, while the sum is 24.
The square root of 1054132161 is about 32467.4015129021. The cubic root of 1054132161 is about 1017.7279174389.
Adding to 1054132161 its reverse (1612314501), we get a palindrome (2666446662).
The spelling of 1054132161 in words is "one billion, fifty-four million, one hundred thirty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •