Base | Representation |
---|---|
bin | 11001101000001… |
… | …101110010000101 |
3 | 1002222001212112121 |
4 | 121220031302011 |
5 | 1340033110423 |
6 | 110355445541 |
7 | 13440464320 |
oct | 3150156205 |
9 | 1088055477 |
10 | 429972613 |
11 | 200787874 |
12 | bbbb68b1 |
13 | 6b106c85 |
14 | 411677b7 |
15 | 27b3445d |
hex | 19a0dc85 |
429972613 has 4 divisors (see below), whose sum is σ = 491397280. Its totient is φ = 368547948.
The previous prime is 429972611. The next prime is 429972637. The reversal of 429972613 is 316279924.
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 429972613 - 21 = 429972611 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 429972613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (429972611) 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, 30712323 + ... + 30712336.
It is an arithmetic number, because the mean of its divisors is an integer number (122849320).
Almost surely, 2429972613 is an apocalyptic number.
It is an amenable number.
429972613 is a deficient number, since it is larger than the sum of its proper divisors (61424667).
429972613 is an equidigital number, since it uses as much as digits as its factorization.
429972613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61424666.
The product of its digits is 163296, while the sum is 43.
The square root of 429972613 is about 20735.7809836042. The cubic root of 429972613 is about 754.7682068438.
The spelling of 429972613 in words is "four hundred twenty-nine million, nine hundred seventy-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •