Base | Representation |
---|---|
bin | 110000110011000010010111… |
… | …1100111100011000000110011 |
3 | 2002021202200202211122020021112 |
4 | 1201212010233213203000303 |
5 | 422224423241030302111 |
6 | 4120520045302343535 |
7 | 156260423563100423 |
oct | 14146045747430063 |
9 | 2067680684566245 |
10 | 429226945556531 |
11 | 114846141930441 |
12 | 4018308372abab |
13 | 15566c0933b415 |
14 | 77dc9a317c483 |
15 | 34952a04e3e8b |
hex | 186612f9e3033 |
429226945556531 has 2 divisors, whose sum is σ = 429226945556532. Its totient is φ = 429226945556530.
The previous prime is 429226945556441. The next prime is 429226945556533. The reversal of 429226945556531 is 135655549622924.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 429226945556531 - 246 = 358858201378867 is a prime.
It is a super-2 number, since 2×4292269455565312 (a number of 30 digits) contains 22 as substring.
Together with 429226945556533, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (429226945556533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 214613472778265 + 214613472778266.
It is an arithmetic number, because the mean of its divisors is an integer number (214613472778266).
Almost surely, 2429226945556531 is an apocalyptic number.
429226945556531 is a deficient number, since it is larger than the sum of its proper divisors (1).
429226945556531 is an equidigital number, since it uses as much as digits as its factorization.
429226945556531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 699840000, while the sum is 68.
The spelling of 429226945556531 in words is "four hundred twenty-nine trillion, two hundred twenty-six billion, nine hundred forty-five million, five hundred fifty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •