Base | Representation |
---|---|
bin | 100010100111001… |
… | …1110100010111101 |
3 | 2222221102101220001 |
4 | 1011032132202331 |
5 | 4334311014122 |
6 | 311125154301 |
7 | 40531634665 |
oct | 10516364275 |
9 | 2887371801 |
10 | 1161423037 |
11 | 546658355 |
12 | 284b5b991 |
13 | 156808588 |
14 | b036b1a5 |
15 | 6be6a527 |
hex | 4539e8bd |
1161423037 has 2 divisors, whose sum is σ = 1161423038. Its totient is φ = 1161423036.
The previous prime is 1161422987. The next prime is 1161423071. The reversal of 1161423037 is 7303241611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1028228356 + 133194681 = 32066^2 + 11541^2 .
It is a cyclic number.
It is not a de Polignac number, because 1161423037 - 27 = 1161422909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1161422996 and 1161423014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1161423097) 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 as a sum of consecutive naturals, namely, 580711518 + 580711519.
It is an arithmetic number, because the mean of its divisors is an integer number (580711519).
Almost surely, 21161423037 is an apocalyptic number.
It is an amenable number.
1161423037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1161423037 is an equidigital number, since it uses as much as digits as its factorization.
1161423037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 1161423037 is about 34079.6572312575. The cubic root of 1161423037 is about 1051.1470569647.
Adding to 1161423037 its reverse (7303241611), we get a palindrome (8464664648).
The spelling of 1161423037 in words is "one billion, one hundred sixty-one million, four hundred twenty-three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •