Base | Representation |
---|---|
bin | 11001000010100110… |
… | …10000111111100011 |
3 | 1021200220111122202021 |
4 | 30201103100333203 |
5 | 210013030202410 |
6 | 10101555002311 |
7 | 654100501063 |
oct | 144123207743 |
9 | 37626448667 |
10 | 13443600355 |
11 | 577961aa19 |
12 | 2732299397 |
13 | 136326a813 |
14 | 91763d3a3 |
15 | 53a378eda |
hex | 3214d0fe3 |
13443600355 has 8 divisors (see below), whose sum is σ = 16151832432. Its totient is φ = 10741872288.
The previous prime is 13443600319. The next prime is 13443600389. The reversal of 13443600355 is 55300634431.
13443600355 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13443600355 - 27 = 13443600227 is a prime.
It is a super-2 number, since 2×134436003552 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13443600355.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1621452 + ... + 1629721.
It is an arithmetic number, because the mean of its divisors is an integer number (2018979054).
Almost surely, 213443600355 is an apocalyptic number.
13443600355 is a deficient number, since it is larger than the sum of its proper divisors (2708232077).
13443600355 is an equidigital number, since it uses as much as digits as its factorization.
13443600355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3252005.
The product of its (nonzero) digits is 64800, while the sum is 34.
The spelling of 13443600355 in words is "thirteen billion, four hundred forty-three million, six hundred thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •