Base | Representation |
---|---|
bin | 1011110111001110100010… |
… | …0111101010111011011111 |
3 | 1201011221100121100000221201 |
4 | 2331303220213222323133 |
5 | 3202200412344033343 |
6 | 43424022131140331 |
7 | 2514233122540003 |
oct | 275635047527337 |
9 | 51157317300851 |
10 | 13043423424223 |
11 | 4179759533055 |
12 | 1567aa01446a7 |
13 | 737cb307568a |
14 | 33143b13a703 |
15 | 1794519a194d |
hex | bdce89eaedf |
13043423424223 has 4 divisors (see below), whose sum is σ = 13101914112448. Its totient is φ = 12984932736000.
The previous prime is 13043423424209. The next prime is 13043423424247. The reversal of 13043423424223 is 32242432434031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13043423424223 - 233 = 13034833489631 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13043423424203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29245343778 + ... + 29245344223.
It is an arithmetic number, because the mean of its divisors is an integer number (3275478528112).
Almost surely, 213043423424223 is an apocalyptic number.
13043423424223 is a deficient number, since it is larger than the sum of its proper divisors (58490688225).
13043423424223 is an equidigital number, since it uses as much as digits as its factorization.
13043423424223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58490688224.
The product of its (nonzero) digits is 331776, while the sum is 37.
Adding to 13043423424223 its reverse (32242432434031), we get a palindrome (45285855858254).
The spelling of 13043423424223 in words is "thirteen trillion, forty-three billion, four hundred twenty-three million, four hundred twenty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •