Base | Representation |
---|---|
bin | 100001100010011… |
… | …0001111000011011 |
3 | 2220102111111120012 |
4 | 1003010301320123 |
5 | 4301040420423 |
6 | 303355352135 |
7 | 36613054610 |
oct | 10304617033 |
9 | 2812444505 |
10 | 1125326363 |
11 | 528243397 |
12 | 274a5264b |
13 | 14c1aa5b5 |
14 | a9652507 |
15 | 68bda078 |
hex | 43131e1b |
1125326363 has 4 divisors (see below), whose sum is σ = 1286087280. Its totient is φ = 964565448.
The previous prime is 1125326333. The next prime is 1125326393. The reversal of 1125326363 is 3636235211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3636235211 = 7 ⋅519462173.
It is an interprime number because it is at equal distance from previous prime (1125326333) and next prime (1125326393).
It is not a de Polignac number, because 1125326363 - 28 = 1125326107 is a prime.
It is a super-3 number, since 3×11253263633 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1125326333) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80380448 + ... + 80380461.
It is an arithmetic number, because the mean of its divisors is an integer number (321521820).
Almost surely, 21125326363 is an apocalyptic number.
1125326363 is a deficient number, since it is larger than the sum of its proper divisors (160760917).
1125326363 is an equidigital number, since it uses as much as digits as its factorization.
1125326363 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160760916.
The product of its digits is 19440, while the sum is 32.
The square root of 1125326363 is about 33545.8844420594. The cubic root of 1125326363 is about 1040.1424740091.
The spelling of 1125326363 in words is "one billion, one hundred twenty-five million, three hundred twenty-six thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •