Base | Representation |
---|---|
bin | 111110011110011… |
… | …000110101101101 |
3 | 2201001021201020021 |
4 | 332132120311231 |
5 | 4121311402303 |
6 | 252001322141 |
7 | 34655104654 |
oct | 7636306555 |
9 | 2631251207 |
10 | 1048153453 |
11 | 498723226 |
12 | 253036351 |
13 | 1391c9c59 |
14 | 9d2c419b |
15 | 62043ebd |
hex | 3e798d6d |
1048153453 has 4 divisors (see below), whose sum is σ = 1048393600. Its totient is φ = 1047913308.
The previous prime is 1048153451. The next prime is 1048153507. The reversal of 1048153453 is 3543518401.
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 1048153453 - 21 = 1048153451 is a prime.
It is a super-2 number, since 2×10481534532 = 2197251322071646418, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1048153451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113403 + ... + 122296.
It is an arithmetic number, because the mean of its divisors is an integer number (262098400).
Almost surely, 21048153453 is an apocalyptic number.
It is an amenable number.
1048153453 is a deficient number, since it is larger than the sum of its proper divisors (240147).
1048153453 is an equidigital number, since it uses as much as digits as its factorization.
1048153453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240146.
The product of its (nonzero) digits is 28800, while the sum is 34.
The square root of 1048153453 is about 32375.1981152239. The cubic root of 1048153453 is about 1015.8001901724.
The spelling of 1048153453 in words is "one billion, forty-eight million, one hundred fifty-three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •