Base | Representation |
---|---|
bin | 110111110111… |
… | …0000001010001 |
3 | 2001002220111111 |
4 | 1233232001101 |
5 | 24444131411 |
6 | 2523413321 |
7 | 503634220 |
oct | 157560121 |
9 | 61086444 |
10 | 29286481 |
11 | 15593404 |
12 | 9984241 |
13 | 60b52a3 |
14 | 3c64cb7 |
15 | 2887721 |
hex | 1bee051 |
29286481 has 4 divisors (see below), whose sum is σ = 33470272. Its totient is φ = 25102692.
The previous prime is 29286473. The next prime is 29286487. The reversal of 29286481 is 18468292.
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 29286481 - 23 = 29286473 is a prime.
It is a super-2 number, since 2×292864812 = 1715395938726722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (29286487) 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 3 ways as a sum of consecutive naturals, for example, 2091885 + ... + 2091898.
It is an arithmetic number, because the mean of its divisors is an integer number (8367568).
Almost surely, 229286481 is an apocalyptic number.
It is an amenable number.
29286481 is a deficient number, since it is larger than the sum of its proper divisors (4183791).
29286481 is an equidigital number, since it uses as much as digits as its factorization.
29286481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4183790.
The product of its digits is 55296, while the sum is 40.
The square root of 29286481 is about 5411.6985318844. The cubic root of 29286481 is about 308.2400480072.
It can be divided in two parts, 2928 and 6481, that added together give a square (9409 = 972).
The spelling of 29286481 in words is "twenty-nine million, two hundred eighty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •