Base | Representation |
---|---|
bin | 100010100111000… |
… | …1001010011111111 |
3 | 2222221020222120210 |
4 | 1011032021103333 |
5 | 4334300223223 |
6 | 311123243503 |
7 | 40531123266 |
oct | 10516112377 |
9 | 2887228523 |
10 | 1161336063 |
11 | 5465a8a78 |
12 | 284b19593 |
13 | 1567a7b04 |
14 | b03475dd |
15 | 6be4e893 |
hex | 453894ff |
1161336063 has 8 divisors (see below), whose sum is σ = 1553920768. Its totient is φ = 771487704.
The previous prime is 1161335971. The next prime is 1161336097. The reversal of 1161336063 is 3606331611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1161336063 - 29 = 1161335551 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1161336063.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1161332063) 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, 683095 + ... + 684792.
It is an arithmetic number, because the mean of its divisors is an integer number (194240096).
Almost surely, 21161336063 is an apocalyptic number.
1161336063 is a deficient number, since it is larger than the sum of its proper divisors (392584705).
1161336063 is a wasteful number, since it uses less digits than its factorization.
1161336063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368173.
The product of its (nonzero) digits is 5832, while the sum is 30.
The square root of 1161336063 is about 34078.3811675379. The cubic root of 1161336063 is about 1051.1208176751.
Adding to 1161336063 its reverse (3606331611), we get a palindrome (4767667674).
The spelling of 1161336063 in words is "one billion, one hundred sixty-one million, three hundred thirty-six thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •