Base | Representation |
---|---|
bin | 11000010010111111… |
… | …11000101100010001 |
3 | 1020200002001211121021 |
4 | 30021133320230101 |
5 | 203203312134010 |
6 | 5554211355441 |
7 | 641151225301 |
oct | 141137705421 |
9 | 36602054537 |
10 | 13044255505 |
11 | 5594162256 |
12 | 26405b2b81 |
13 | 12cb5c84a8 |
14 | 8ba5a9601 |
15 | 5152948da |
hex | 3097f8b11 |
13044255505 has 8 divisors (see below), whose sum is σ = 15653806272. Its totient is φ = 10434937968.
The previous prime is 13044255491. The next prime is 13044255509. The reversal of 13044255505 is 50555244031.
13044255505 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 13044255505 - 27 = 13044255377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13044255509) 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 7 ways as a sum of consecutive naturals, for example, 107724 + ... + 194146.
It is an arithmetic number, because the mean of its divisors is an integer number (1956725784).
Almost surely, 213044255505 is an apocalyptic number.
It is an amenable number.
13044255505 is a deficient number, since it is larger than the sum of its proper divisors (2609550767).
13044255505 is an equidigital number, since it uses as much as digits as its factorization.
13044255505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116615.
The product of its (nonzero) digits is 60000, while the sum is 34.
Adding to 13044255505 its reverse (50555244031), we get a palindrome (63599499536).
The spelling of 13044255505 in words is "thirteen billion, forty-four million, two hundred fifty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •