Base | Representation |
---|---|
bin | 100001111111011… |
… | …0010010011100011 |
3 | 2221111010001101122 |
4 | 1003332302103203 |
5 | 4313434014301 |
6 | 305101322455 |
7 | 40156236332 |
oct | 10376622343 |
9 | 2844101348 |
10 | 1140532451 |
11 | 535889a03 |
12 | 279b6642b |
13 | 1523a2996 |
14 | ab68dd19 |
15 | 6a1e081b |
hex | 43fb24e3 |
1140532451 has 4 divisors (see below), whose sum is σ = 1141864152. Its totient is φ = 1139200752.
The previous prime is 1140532447. The next prime is 1140532453. The reversal of 1140532451 is 1542350411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1140532451 - 22 = 1140532447 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 1140532451.
It is not an unprimeable number, because it can be changed into a prime (1140532453) 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, 664565 + ... + 666278.
It is an arithmetic number, because the mean of its divisors is an integer number (285466038).
Almost surely, 21140532451 is an apocalyptic number.
1140532451 is a deficient number, since it is larger than the sum of its proper divisors (1331701).
1140532451 is an equidigital number, since it uses as much as digits as its factorization.
1140532451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1331700.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 1140532451 is about 33771.7700306040. The cubic root of 1140532451 is about 1044.8065394332.
Adding to 1140532451 its reverse (1542350411), we get a palindrome (2682882862).
The spelling of 1140532451 in words is "one billion, one hundred forty million, five hundred thirty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •