Base | Representation |
---|---|
bin | 101000001100001011… |
… | …000100110000100101 |
3 | 11010101110200101112222 |
4 | 220030023010300211 |
5 | 1201334344341004 |
6 | 31454041522125 |
7 | 3055252056125 |
oct | 501413046045 |
9 | 133343611488 |
10 | 43153902629 |
11 | 17335286842 |
12 | 84441a3345 |
13 | 40b9601136 |
14 | 21353d6c85 |
15 | 11c882b7be |
hex | a0c2c4c25 |
43153902629 has 2 divisors, whose sum is σ = 43153902630. Its totient is φ = 43153902628.
The previous prime is 43153902611. The next prime is 43153902713. The reversal of 43153902629 is 92620935134.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33749364100 + 9404538529 = 183710^2 + 96977^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-43153902629 is a prime.
It is a super-2 number, since 2×431539026292 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 43153902629.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43153902529) 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 as a sum of consecutive naturals, namely, 21576951314 + 21576951315.
It is an arithmetic number, because the mean of its divisors is an integer number (21576951315).
Almost surely, 243153902629 is an apocalyptic number.
It is an amenable number.
43153902629 is a deficient number, since it is larger than the sum of its proper divisors (1).
43153902629 is an equidigital number, since it uses as much as digits as its factorization.
43153902629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 349920, while the sum is 44.
The spelling of 43153902629 in words is "forty-three billion, one hundred fifty-three million, nine hundred two thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •