Base | Representation |
---|---|
bin | 1001011110000001011101 |
3 | 11200010000220 |
4 | 21132001131 |
5 | 1113413034 |
6 | 125111553 |
7 | 30045636 |
oct | 11360135 |
9 | 4603026 |
10 | 2482269 |
11 | 1445a69 |
12 | 9b85b9 |
13 | 68baca |
14 | 48888d |
15 | 340749 |
hex | 25e05d |
2482269 has 4 divisors (see below), whose sum is σ = 3309696. Its totient is φ = 1654844.
The previous prime is 2482253. The next prime is 2482279. The reversal of 2482269 is 9622842.
2482269 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2482269 - 24 = 2482253 is a prime.
It is a super-2 number, since 2×24822692 = 12323318776722, which contains 22 as substring.
It is a D-number.
It is a plaindrome in base 14.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2482279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 413709 + ... + 413714.
It is an arithmetic number, because the mean of its divisors is an integer number (827424).
22482269 is an apocalyptic number.
It is an amenable number.
2482269 is a deficient number, since it is larger than the sum of its proper divisors (827427).
2482269 is an equidigital number, since it uses as much as digits as its factorization.
2482269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 827426.
The product of its digits is 13824, while the sum is 33.
The square root of 2482269 is about 1575.5218183193. The cubic root of 2482269 is about 135.3992570071.
The spelling of 2482269 in words is "two million, four hundred eighty-two thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •