Base | Representation |
---|---|
bin | 1011110111010110010010… |
… | …0010000010100101101111 |
3 | 1201012010201111011001000202 |
4 | 2331311210202002211233 |
5 | 3202214142043314210 |
6 | 43425004313144115 |
7 | 2514335465100356 |
oct | 275654442024557 |
9 | 51163644131022 |
10 | 13045502323055 |
11 | 417a625a69564 |
12 | 15683803bb03b |
13 | 738254985b27 |
14 | 33159729299d |
15 | 17952424b9a5 |
hex | bdd6488296f |
13045502323055 has 4 divisors (see below), whose sum is σ = 15654602787672. Its totient is φ = 10436401858440.
The previous prime is 13045502323027. The next prime is 13045502323057. The reversal of 13045502323055 is 55032320554031.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 13045502323055 - 224 = 13045485545839 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13045502323057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1304550232301 + ... + 1304550232310.
It is an arithmetic number, because the mean of its divisors is an integer number (3913650696918).
Almost surely, 213045502323055 is an apocalyptic number.
13045502323055 is a deficient number, since it is larger than the sum of its proper divisors (2609100464617).
13045502323055 is an equidigital number, since it uses as much as digits as its factorization.
13045502323055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2609100464616.
The product of its (nonzero) digits is 270000, while the sum is 38.
Adding to 13045502323055 its reverse (55032320554031), we get a palindrome (68077822877086).
The spelling of 13045502323055 in words is "thirteen trillion, forty-five billion, five hundred two million, three hundred twenty-three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •