Base | Representation |
---|---|
bin | 111000100111… |
… | …0011111011111 |
3 | 2001211222112200 |
4 | 1301032133133 |
5 | 30044303011 |
6 | 2540102543 |
7 | 510201240 |
oct | 161163737 |
9 | 61758480 |
10 | 29681631 |
11 | 15833281 |
12 | 9b34a53 |
13 | 61c30c5 |
14 | 3d28cc7 |
15 | 2914856 |
hex | 1c4e7df |
29681631 has 12 divisors (see below), whose sum is σ = 48998352. Its totient is φ = 16960896.
The previous prime is 29681627. The next prime is 29681633. The reversal of 29681631 is 13618692.
It is not a de Polignac number, because 29681631 - 22 = 29681627 is a prime.
It is a super-2 number, since 2×296816312 = 1761998437640322, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29681633) 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 in 11 ways as a sum of consecutive naturals, for example, 235506 + ... + 235631.
It is an arithmetic number, because the mean of its divisors is an integer number (4083196).
Almost surely, 229681631 is an apocalyptic number.
29681631 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
29681631 is a deficient number, since it is larger than the sum of its proper divisors (19316721).
29681631 is a wasteful number, since it uses less digits than its factorization.
29681631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471150 (or 471147 counting only the distinct ones).
The product of its digits is 15552, while the sum is 36.
The square root of 29681631 is about 5448.0850764282. The cubic root of 29681631 is about 309.6201765089.
The spelling of 29681631 in words is "twenty-nine million, six hundred eighty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •