Base | Representation |
---|---|
bin | 11000110111101100… |
… | …11000110100010001 |
3 | 1021110112102012102020 |
4 | 30123312120310101 |
5 | 204321122103040 |
6 | 10044530442053 |
7 | 651610231644 |
oct | 143366306421 |
9 | 37415365366 |
10 | 13352144145 |
11 | 5731a3457a |
12 | 2707733329 |
13 | 134a328b12 |
14 | 909433a5b |
15 | 532310cd0 |
hex | 31bd98d11 |
13352144145 has 8 divisors (see below), whose sum is σ = 21363430656. Its totient is φ = 7121143536.
The previous prime is 13352144129. The next prime is 13352144159. The reversal of 13352144145 is 54144125331.
13352144145 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 not a de Polignac number, because 13352144145 - 24 = 13352144129 is a prime.
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, 445071457 + ... + 445071486.
It is an arithmetic number, because the mean of its divisors is an integer number (2670428832).
Almost surely, 213352144145 is an apocalyptic number.
13352144145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13352144145 is a deficient number, since it is larger than the sum of its proper divisors (8011286511).
13352144145 is an equidigital number, since it uses as much as digits as its factorization.
13352144145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890142951.
The product of its digits is 28800, while the sum is 33.
Adding to 13352144145 its reverse (54144125331), we get a palindrome (67496269476).
The spelling of 13352144145 in words is "thirteen billion, three hundred fifty-two million, one hundred forty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •