Base | Representation |
---|---|
bin | 11001000011110000… |
… | …10100011001110111 |
3 | 1021201120210010220010 |
4 | 30201320110121313 |
5 | 210023022014110 |
6 | 10102543111303 |
7 | 654246164535 |
oct | 144170243167 |
9 | 37646703803 |
10 | 13453313655 |
11 | 5784054741 |
12 | 27355a2533 |
13 | 136528ba32 |
14 | 918a4b155 |
15 | 53b147020 |
hex | 321e14677 |
13453313655 has 8 divisors (see below), whose sum is σ = 21525301872. Its totient is φ = 7175100608.
The previous prime is 13453313651. The next prime is 13453313677. The reversal of 13453313655 is 55631335431.
13453313655 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 13453313655 - 22 = 13453313651 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13453313651) 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, 448443774 + ... + 448443803.
It is an arithmetic number, because the mean of its divisors is an integer number (2690662734).
Almost surely, 213453313655 is an apocalyptic number.
13453313655 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13453313655 is a deficient number, since it is larger than the sum of its proper divisors (8071988217).
13453313655 is an equidigital number, since it uses as much as digits as its factorization.
13453313655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896887585.
The product of its digits is 243000, while the sum is 39.
The spelling of 13453313655 in words is "thirteen billion, four hundred fifty-three million, three hundred thirteen thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •