Base | Representation |
---|---|
bin | 100010010110001… |
… | …0001101011101101 |
3 | 2222022112220102101 |
4 | 1010230101223231 |
5 | 4330012114303 |
6 | 310205055101 |
7 | 40362504160 |
oct | 10454215355 |
9 | 2868486371 |
10 | 1152457453 |
11 | 541594384 |
12 | 281b57491 |
13 | 1549b97b4 |
14 | ad0b5ad7 |
15 | 6b298d1d |
hex | 44b11aed |
1152457453 has 4 divisors (see below), whose sum is σ = 1317094240. Its totient is φ = 987820668.
The previous prime is 1152457447. The next prime is 1152457487. The reversal of 1152457453 is 3547542511.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3547542511 = 191 ⋅18573521.
It is a cyclic number.
It is not a de Polignac number, because 1152457453 - 29 = 1152456941 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1152457403) 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, 82318383 + ... + 82318396.
It is an arithmetic number, because the mean of its divisors is an integer number (329273560).
Almost surely, 21152457453 is an apocalyptic number.
It is an amenable number.
1152457453 is a deficient number, since it is larger than the sum of its proper divisors (164636787).
1152457453 is an equidigital number, since it uses as much as digits as its factorization.
1152457453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164636786.
The product of its digits is 84000, while the sum is 37.
The square root of 1152457453 is about 33947.8637472227. The cubic root of 1152457453 is about 1048.4352969614.
Adding to 1152457453 its reverse (3547542511), we get a palindrome (4699999964).
The spelling of 1152457453 in words is "one billion, one hundred fifty-two million, four hundred fifty-seven thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •