Base | Representation |
---|---|
bin | 100001100010011… |
… | …0110000010101101 |
3 | 2220102112100221101 |
4 | 1003010312002231 |
5 | 4301041442110 |
6 | 303400003101 |
7 | 36613155364 |
oct | 10304660255 |
9 | 2812470841 |
10 | 1125343405 |
11 | 52825517a |
12 | 274a60491 |
13 | 14c1b5294 |
14 | a96587db |
15 | 68be013a |
hex | 431360ad |
1125343405 has 8 divisors (see below), whose sum is σ = 1396978200. Its totient is φ = 869230656.
The previous prime is 1125343319. The next prime is 1125343423. The reversal of 1125343405 is 5043435211.
It can be written as a sum of positive squares in 4 ways, for example, as 216501796 + 908841609 = 14714^2 + 30147^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1125343405 - 29 = 1125342893 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3880350 + ... + 3880639.
It is an arithmetic number, because the mean of its divisors is an integer number (174622275).
Almost surely, 21125343405 is an apocalyptic number.
It is an amenable number.
1125343405 is a deficient number, since it is larger than the sum of its proper divisors (271634795).
1125343405 is an equidigital number, since it uses as much as digits as its factorization.
1125343405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7761023.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 1125343405 is about 33546.1384513926. The cubic root of 1125343405 is about 1040.1477246395.
Adding to 1125343405 its reverse (5043435211), we get a palindrome (6168778616).
The spelling of 1125343405 in words is "one billion, one hundred twenty-five million, three hundred forty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •