Base | Representation |
---|---|
bin | 11001001111111010… |
… | …00010011000010011 |
3 | 1021222200112012200011 |
4 | 30213331002120103 |
5 | 210230113320333 |
6 | 10121023135351 |
7 | 656624262613 |
oct | 144775023023 |
9 | 37880465604 |
10 | 13555213843 |
11 | 5826623876 |
12 | 2763744557 |
13 | 13804193c2 |
14 | 9283b4a43 |
15 | 5450749cd |
hex | 327f42613 |
13555213843 has 4 divisors (see below), whose sum is σ = 14022635040. Its totient is φ = 13087792648.
The previous prime is 13555213817. The next prime is 13555213849. The reversal of 13555213843 is 34831255531.
It is a happy number.
13555213843 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13555213843 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13555213796 and 13555213805.
It is not an unprimeable number, because it can be changed into a prime (13555213849) 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 3 ways as a sum of consecutive naturals, for example, 233710555 + ... + 233710612.
It is an arithmetic number, because the mean of its divisors is an integer number (3505658760).
Almost surely, 213555213843 is an apocalyptic number.
13555213843 is a deficient number, since it is larger than the sum of its proper divisors (467421197).
13555213843 is an equidigital number, since it uses as much as digits as its factorization.
13555213843 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467421196.
The product of its digits is 216000, while the sum is 40.
The spelling of 13555213843 in words is "thirteen billion, five hundred fifty-five million, two hundred thirteen thousand, eight hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •