Base | Representation |
---|---|
bin | 100010101101000… |
… | …1110101111101010 |
3 | 10000011012221020100 |
4 | 1011122032233222 |
5 | 4341103112132 |
6 | 311315210230 |
7 | 40600056342 |
oct | 10532165752 |
9 | 3004187210 |
10 | 1164504042 |
11 | 548372139 |
12 | 285ba6976 |
13 | 157346a60 |
14 | b092dd22 |
15 | 6c37837c |
hex | 4568ebea |
1164504042 has 48 divisors (see below), whose sum is σ = 2721694248. Its totient is φ = 357713280.
The previous prime is 1164504041. The next prime is 1164504049. The reversal of 1164504042 is 2404054611.
1164504042 is a `hidden beast` number, since 11 + 645 + 0 + 4 + 0 + 4 + 2 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 887980401 + 276523641 = 29799^2 + 16629^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1164503997 and 1164504015.
It is not an unprimeable number, because it can be changed into a prime (1164504041) 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 23 ways as a sum of consecutive naturals, for example, 148992 + ... + 156612.
Almost surely, 21164504042 is an apocalyptic number.
1164504042 is an abundant number, since it is smaller than the sum of its proper divisors (1557190206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1164504042 is a wasteful number, since it uses less digits than its factorization.
1164504042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8295 (or 8292 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 1164504042 is about 34124.8302852923. The cubic root of 1164504042 is about 1052.0757251268.
Adding to 1164504042 its reverse (2404054611), we get a palindrome (3568558653).
The spelling of 1164504042 in words is "one billion, one hundred sixty-four million, five hundred four thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •