Base | Representation |
---|---|
bin | 11001000010100011… |
… | …10110100101011011 |
3 | 1021200212210211210000 |
4 | 30201101312211123 |
5 | 210012431330133 |
6 | 10101543024043 |
7 | 654064366335 |
oct | 144121664533 |
9 | 37625724700 |
10 | 13443230043 |
11 | 5779397781 |
12 | 273213b023 |
13 | 136316b0b9 |
14 | 917584455 |
15 | 53a304413 |
hex | 32147695b |
13443230043 has 10 divisors (see below), whose sum is σ = 20081862284. Its totient is φ = 8962153308.
The previous prime is 13443230039. The next prime is 13443230057. The reversal of 13443230043 is 34003234431.
13443230043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13443230043 - 22 = 13443230039 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13443229989 and 13443230016.
It is not an unprimeable number, because it can be changed into a prime (13443230023) 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 9 ways as a sum of consecutive naturals, for example, 82982821 + ... + 82982982.
Almost surely, 213443230043 is an apocalyptic number.
13443230043 is a deficient number, since it is larger than the sum of its proper divisors (6638632241).
13443230043 is an equidigital number, since it uses as much as digits as its factorization.
13443230043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165965815 (or 165965806 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 13443230043 its reverse (34003234431), we get a palindrome (47446464474).
The spelling of 13443230043 in words is "thirteen billion, four hundred forty-three million, two hundred thirty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •