Base | Representation |
---|---|
bin | 1010101111101… |
… | …1111000100111 |
3 | 10010210220001001 |
4 | 2223323320213 |
5 | 43014300121 |
6 | 4250014131 |
7 | 1055050663 |
oct | 253737047 |
9 | 103726031 |
10 | 45071911 |
11 | 23495215 |
12 | 13117347 |
13 | 9451291 |
14 | 5db38a3 |
15 | 3e54991 |
hex | 2afbe27 |
45071911 has 2 divisors, whose sum is σ = 45071912. Its totient is φ = 45071910.
The previous prime is 45071909. The next prime is 45071951. The reversal of 45071911 is 11917054.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 45071911 - 21 = 45071909 is a prime.
It is a super-2 number, since 2×450719112 = 4062954322383842, which contains 22 as substring.
Together with 45071909, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 45071911.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45071951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22535955 + 22535956.
It is an arithmetic number, because the mean of its divisors is an integer number (22535956).
Almost surely, 245071911 is an apocalyptic number.
45071911 is a deficient number, since it is larger than the sum of its proper divisors (1).
45071911 is an equidigital number, since it uses as much as digits as its factorization.
45071911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 28.
The square root of 45071911 is about 6713.5617223647. The cubic root of 45071911 is about 355.8786960994.
Adding to 45071911 its reverse (11917054), we get a palindrome (56988965).
It can be divided in two parts, 450 and 71911, that added together give a square (72361 = 2692).
The spelling of 45071911 in words is "forty-five million, seventy-one thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •