Base | Representation |
---|---|
bin | 100001110011111… |
… | …0010110101110001 |
3 | 2221001202211201220 |
4 | 1003213302311301 |
5 | 4310413132304 |
6 | 304324215253 |
7 | 40054064466 |
oct | 10347626561 |
9 | 2831684656 |
10 | 1134505329 |
11 | 532442711 |
12 | 277b3a529 |
13 | 151072539 |
14 | aa96166d |
15 | 698eead9 |
hex | 439f2d71 |
1134505329 has 4 divisors (see below), whose sum is σ = 1512673776. Its totient is φ = 756336884.
The previous prime is 1134505321. The next prime is 1134505343. The reversal of 1134505329 is 9235054311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1134505329 - 23 = 1134505321 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1134505329.
It is not an unprimeable number, because it can be changed into a prime (1134505321) 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, 189084219 + ... + 189084224.
It is an arithmetic number, because the mean of its divisors is an integer number (378168444).
Almost surely, 21134505329 is an apocalyptic number.
It is an amenable number.
1134505329 is a deficient number, since it is larger than the sum of its proper divisors (378168447).
1134505329 is an equidigital number, since it uses as much as digits as its factorization.
1134505329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378168446.
The product of its (nonzero) digits is 16200, while the sum is 33.
The square root of 1134505329 is about 33682.4186928433. The cubic root of 1134505329 is about 1042.9628679121.
The spelling of 1134505329 in words is "one billion, one hundred thirty-four million, five hundred five thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •