Base | Representation |
---|---|
bin | 11011111010111010… |
… | …100010011100001001 |
3 | 2212101022122000110021 |
4 | 123322322202130021 |
5 | 442344220000233 |
6 | 21434455420441 |
7 | 2110630101424 |
oct | 337272423411 |
9 | 85338560407 |
10 | 29979453193 |
11 | 1179468a9a8 |
12 | 5988084721 |
13 | 2a9a04cb21 |
14 | 164581a9bb |
15 | ba6e1ae2d |
hex | 6faea2709 |
29979453193 has 4 divisors (see below), whose sum is σ = 30390130708. Its totient is φ = 29568775680.
The previous prime is 29979453191. The next prime is 29979453197. The reversal of 29979453193 is 39135497992.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10972143504 + 19007309689 = 104748^2 + 137867^2 .
It is a cyclic number.
It is not a de Polignac number, because 29979453193 - 21 = 29979453191 is a prime.
It is a super-2 number, since 2×299794531932 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (29979453191) 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, 205338648 + ... + 205338793.
It is an arithmetic number, because the mean of its divisors is an integer number (7597532677).
Almost surely, 229979453193 is an apocalyptic number.
It is an amenable number.
29979453193 is a deficient number, since it is larger than the sum of its proper divisors (410677515).
29979453193 is an equidigital number, since it uses as much as digits as its factorization.
29979453193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410677514.
The product of its digits is 16533720, while the sum is 61.
The spelling of 29979453193 in words is "twenty-nine billion, nine hundred seventy-nine million, four hundred fifty-three thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •