Base | Representation |
---|---|
bin | 100010100111001… |
… | …1111000110101011 |
3 | 2222221102112000201 |
4 | 1011032133012223 |
5 | 4334311102243 |
6 | 311125213031 |
7 | 40531644442 |
oct | 10516370653 |
9 | 2887375021 |
10 | 1161425323 |
11 | 54665a043 |
12 | 284b61177 |
13 | 156809626 |
14 | b036bd59 |
15 | 6be6b04d |
hex | 4539f1ab |
1161425323 has 4 divisors (see below), whose sum is σ = 1198890688. Its totient is φ = 1123959960.
The previous prime is 1161425303. The next prime is 1161425333. The reversal of 1161425323 is 3235241611.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1161425323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1161425291 and 1161425300.
It is not an unprimeable number, because it can be changed into a prime (1161425303) 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 3 ways as a sum of consecutive naturals, for example, 18732636 + ... + 18732697.
It is an arithmetic number, because the mean of its divisors is an integer number (299722672).
Almost surely, 21161425323 is an apocalyptic number.
1161425323 is a deficient number, since it is larger than the sum of its proper divisors (37465365).
1161425323 is an equidigital number, since it uses as much as digits as its factorization.
1161425323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37465364.
The product of its digits is 4320, while the sum is 28.
The square root of 1161425323 is about 34079.6907703107. The cubic root of 1161425323 is about 1051.1477466131.
Adding to 1161425323 its reverse (3235241611), we get a palindrome (4396666934).
The spelling of 1161425323 in words is "one billion, one hundred sixty-one million, four hundred twenty-five thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •