Base | Representation |
---|---|
bin | 1010101110110… |
… | …1000110000011 |
3 | 10010200210221100 |
4 | 2223231012003 |
5 | 43010330311 |
6 | 4244425443 |
7 | 1054406241 |
oct | 253550603 |
9 | 103623840 |
10 | 45011331 |
11 | 23453752 |
12 | 130a8283 |
13 | 942c831 |
14 | 5d99791 |
15 | 3e41a56 |
hex | 2aed183 |
45011331 has 12 divisors (see below), whose sum is σ = 65114608. Its totient is φ = 29962224.
The previous prime is 45011327. The next prime is 45011333. The reversal of 45011331 is 13311054.
45011331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 45011331 - 22 = 45011327 is a prime.
It is a super-3 number, since 3×450113313 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (45011333) 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 11 ways as a sum of consecutive naturals, for example, 3186 + ... + 10008.
Almost surely, 245011331 is an apocalyptic number.
45011331 is a deficient number, since it is larger than the sum of its proper divisors (20103277).
45011331 is a wasteful number, since it uses less digits than its factorization.
45011331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7562 (or 7559 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 45011331 is about 6709.0484422159. The cubic root of 45011331 is about 355.7191821347.
Adding to 45011331 its reverse (13311054), we get a palindrome (58322385).
It can be divided in two parts, 4501 and 1331, that added together give a cube (5832 = 183).
The spelling of 45011331 in words is "forty-five million, eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •