Base | Representation |
---|---|
bin | 100000000000011000001… |
… | …011110111101100001101 |
3 | 21210021002222201202201222 |
4 | 200000120023313230031 |
5 | 242013412312123204 |
6 | 4402223113013125 |
7 | 314621621131424 |
oct | 40003013675415 |
9 | 7707088652658 |
10 | 2199429020429 |
11 | 778855385643 |
12 | 2b63203b41a5 |
13 | 12c5364a8ac4 |
14 | 7864abc02bb |
15 | 3c32b267abe |
hex | 200182f7b0d |
2199429020429 has 4 divisors (see below), whose sum is σ = 2250578532576. Its totient is φ = 2148279508284.
The previous prime is 2199429020401. The next prime is 2199429020461. The reversal of 2199429020429 is 9240209249912.
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 2199429020429 - 212 = 2199429016333 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2199429020479) 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 3 ways as a sum of consecutive naturals, for example, 25574756009 + ... + 25574756094.
It is an arithmetic number, because the mean of its divisors is an integer number (562644633144).
Almost surely, 22199429020429 is an apocalyptic number.
It is an amenable number.
2199429020429 is a deficient number, since it is larger than the sum of its proper divisors (51149512147).
2199429020429 is an equidigital number, since it uses as much as digits as its factorization.
2199429020429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51149512146.
The product of its (nonzero) digits is 1679616, while the sum is 53.
The spelling of 2199429020429 in words is "two trillion, one hundred ninety-nine billion, four hundred twenty-nine million, twenty thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •