Base | Representation |
---|---|
bin | 111101111011110101001 |
3 | 10211002220222 |
4 | 13233132221 |
5 | 1004420411 |
6 | 111255425 |
7 | 23151566 |
oct | 7573651 |
9 | 3732828 |
10 | 2029481 |
11 | 1166863 |
12 | 81a575 |
13 | 56099c |
14 | 3ab86d |
15 | 2a14db |
hex | 1ef7a9 |
2029481 has 4 divisors (see below), whose sum is σ = 2032464. Its totient is φ = 2026500.
The previous prime is 2029457. The next prime is 2029483. The reversal of 2029481 is 1849202.
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 a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 1849202 = 2 ⋅924601.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2029481 is a prime.
It is a super-2 number, since 2×20294812 = 8237586258722, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2029481.
It is not an unprimeable number, because it can be changed into a prime (2029483) 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, 86 + ... + 2016.
It is an arithmetic number, because the mean of its divisors is an integer number (508116).
22029481 is an apocalyptic number.
It is an amenable number.
2029481 is a deficient number, since it is larger than the sum of its proper divisors (2983).
2029481 is a wasteful number, since it uses less digits than its factorization.
2029481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2982.
The product of its (nonzero) digits is 1152, while the sum is 26.
The square root of 2029481 is about 1424.5985399403. The cubic root of 2029481 is about 126.6081501025.
The spelling of 2029481 in words is "two million, twenty-nine thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •