Base | Representation |
---|---|
bin | 101000001001000101… |
… | …100111100000000101 |
3 | 11010020212021121011011 |
4 | 220021011213200011 |
5 | 1201233121443141 |
6 | 31444552242221 |
7 | 3054053101654 |
oct | 501105474005 |
9 | 133225247134 |
10 | 43102140421 |
11 | 1730904205a |
12 | 842a9a0371 |
13 | 40ab979902 |
14 | 212c5a119b |
15 | 11c4004881 |
hex | a09167805 |
43102140421 has 8 divisors (see below), whose sum is σ = 43176115584. Its totient is φ = 43028198400.
The previous prime is 43102140379. The next prime is 43102140469. The reversal of 43102140421 is 12404120134.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 43102140421 - 27 = 43102140293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 43102140392 and 43102140401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43102140481) 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 7 ways as a sum of consecutive naturals, for example, 5416996 + ... + 5424946.
It is an arithmetic number, because the mean of its divisors is an integer number (5397014448).
Almost surely, 243102140421 is an apocalyptic number.
It is an amenable number.
43102140421 is a deficient number, since it is larger than the sum of its proper divisors (73975163).
43102140421 is an equidigital number, since it uses as much as digits as its factorization.
43102140421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16571.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 43102140421 its reverse (12404120134), we get a palindrome (55506260555).
The spelling of 43102140421 in words is "forty-three billion, one hundred two million, one hundred forty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •