Base | Representation |
---|---|
bin | 111110011111110… |
… | …011101000010011 |
3 | 2201001222121100112 |
4 | 332133303220103 |
5 | 4121410302311 |
6 | 252013311535 |
7 | 34661214110 |
oct | 7637635023 |
9 | 2631877315 |
10 | 1048525331 |
11 | 498957667 |
12 | 2531955ab |
13 | 1392ca2b9 |
14 | 9d37d907 |
15 | 620b928b |
hex | 3e7f3a13 |
1048525331 has 4 divisors (see below), whose sum is σ = 1198314672. Its totient is φ = 898735992.
The previous prime is 1048525327. The next prime is 1048525333. The reversal of 1048525331 is 1335258401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1335258401 = 6199 ⋅215399.
It is not a de Polignac number, because 1048525331 - 22 = 1048525327 is a prime.
It is a super-2 number, since 2×10485253312 = 2198810739497319122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1048525333) 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, 74894660 + ... + 74894673.
It is an arithmetic number, because the mean of its divisors is an integer number (299578668).
Almost surely, 21048525331 is an apocalyptic number.
1048525331 is a deficient number, since it is larger than the sum of its proper divisors (149789341).
1048525331 is an equidigital number, since it uses as much as digits as its factorization.
1048525331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149789340.
The product of its (nonzero) digits is 14400, while the sum is 32.
The square root of 1048525331 is about 32380.9408603271. The cubic root of 1048525331 is about 1015.9203090589.
The spelling of 1048525331 in words is "one billion, forty-eight million, five hundred twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •