Base | Representation |
---|---|
bin | 11011111000110001… |
… | …100010101011010101 |
3 | 2212021211001110102012 |
4 | 123320301202223111 |
5 | 442311021243222 |
6 | 21431133554005 |
7 | 2110012615466 |
oct | 337061425325 |
9 | 85254043365 |
10 | 29943540437 |
11 | 11776391138 |
12 | 5978045905 |
13 | 2a92787785 |
14 | 1640b4cd6d |
15 | ba3bc51e2 |
hex | 6f8c62ad5 |
29943540437 has 4 divisors (see below), whose sum is σ = 30022547520. Its totient is φ = 29864533356.
The previous prime is 29943540391. The next prime is 29943540439. The reversal of 29943540437 is 73404534992.
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 29943540437 - 212 = 29943536341 is a prime.
It is a super-2 number, since 2×299435404372 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29943540439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39502973 + ... + 39503730.
It is an arithmetic number, because the mean of its divisors is an integer number (7505636880).
Almost surely, 229943540437 is an apocalyptic number.
It is an amenable number.
29943540437 is a deficient number, since it is larger than the sum of its proper divisors (79007083).
29943540437 is an equidigital number, since it uses as much as digits as its factorization.
29943540437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79007082.
The product of its (nonzero) digits is 3265920, while the sum is 50.
The spelling of 29943540437 in words is "twenty-nine billion, nine hundred forty-three million, five hundred forty thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •