Base | Representation |
---|---|
bin | 1001001000101000… |
… | …1001101000110101 |
3 | 20022220010100002120 |
4 | 2102022021220311 |
5 | 20010221300303 |
6 | 1043153430153 |
7 | 114523541016 |
oct | 22212115065 |
9 | 6286110076 |
10 | 2452134453 |
11 | 10491909aa |
12 | 58526b359 |
13 | 301040742 |
14 | 19395100d |
15 | e5423553 |
hex | 92289a35 |
2452134453 has 4 divisors (see below), whose sum is σ = 3269512608. Its totient is φ = 1634756300.
The previous prime is 2452134449. The next prime is 2452134463. The reversal of 2452134453 is 3544312542.
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 2452134453 - 22 = 2452134449 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2452134463) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 408689073 + ... + 408689078.
It is an arithmetic number, because the mean of its divisors is an integer number (817378152).
Almost surely, 22452134453 is an apocalyptic number.
It is an amenable number.
2452134453 is a deficient number, since it is larger than the sum of its proper divisors (817378155).
2452134453 is an equidigital number, since it uses as much as digits as its factorization.
2452134453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 817378154.
The product of its digits is 57600, while the sum is 33.
The square root of 2452134453 is about 49519.0312203298. The cubic root of 2452134453 is about 1348.4911268051.
Adding to 2452134453 its reverse (3544312542), we get a palindrome (5996446995).
The spelling of 2452134453 in words is "two billion, four hundred fifty-two million, one hundred thirty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •