Base | Representation |
---|---|
bin | 1010101111100… |
… | …1011111000001 |
3 | 10010210101112222 |
4 | 2223321133001 |
5 | 43013441311 |
6 | 4245500425 |
7 | 1055010221 |
oct | 253713701 |
9 | 103711488 |
10 | 45062081 |
11 | 23488899 |
12 | 13111715 |
13 | 944996c |
14 | 5db0081 |
15 | 3e51adb |
hex | 2af97c1 |
45062081 has 4 divisors (see below), whose sum is σ = 45101232. Its totient is φ = 45022932.
The previous prime is 45062077. The next prime is 45062093. The reversal of 45062081 is 18026054.
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, and also an emirpimes, since its reverse is a distinct semiprime: 18026054 = 2 ⋅9013027.
It is a cyclic number.
It is not a de Polignac number, because 45062081 - 22 = 45062077 is a prime.
It is a super-2 number, since 2×450620812 = 4061182288101122, which contains 22 as substring.
It is a Duffinian number.
It is a plaindrome in base 11.
It is a self number, because there is not a number n which added to its sum of digits gives 45062081.
It is not an unprimeable number, because it can be changed into a prime (45062051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17795 + ... + 20168.
It is an arithmetic number, because the mean of its divisors is an integer number (11275308).
Almost surely, 245062081 is an apocalyptic number.
It is an amenable number.
45062081 is a deficient number, since it is larger than the sum of its proper divisors (39151).
45062081 is a wasteful number, since it uses less digits than its factorization.
45062081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39150.
The product of its (nonzero) digits is 1920, while the sum is 26.
The square root of 45062081 is about 6712.8295822254. The cubic root of 45062081 is about 355.8528223208.
The spelling of 45062081 in words is "forty-five million, sixty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •