Base | Representation |
---|---|
bin | 10011100100111011011… |
… | …110001000111010111111 |
3 | 11202121111211200000220110 |
4 | 103210323132020322333 |
5 | 134020210031122010 |
6 | 2510011014321103 |
7 | 166124226513060 |
oct | 23447336107277 |
9 | 4677454600813 |
10 | 1345322520255 |
11 | 4796035434aa |
12 | 198895959193 |
13 | 99b2ba8c96c |
14 | 491849b0567 |
15 | 24edcd20120 |
hex | 1393b788ebf |
1345322520255 has 32 divisors (see below), whose sum is σ = 2526505311744. Its totient is φ = 598382833536.
The previous prime is 1345322520251. The next prime is 1345322520259. The reversal of 1345322520255 is 5520252235431.
It is an interprime number because it is at equal distance from previous prime (1345322520251) and next prime (1345322520259).
It is not a de Polignac number, because 1345322520255 - 22 = 1345322520251 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1345322520251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 173139297 + ... + 173147066.
It is an arithmetic number, because the mean of its divisors is an integer number (78953290992).
Almost surely, 21345322520255 is an apocalyptic number.
1345322520255 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1345322520255 is a deficient number, since it is larger than the sum of its proper divisors (1181182791489).
1345322520255 is a wasteful number, since it uses less digits than its factorization.
1345322520255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346286415.
The product of its (nonzero) digits is 360000, while the sum is 39.
Adding to 1345322520255 its reverse (5520252235431), we get a palindrome (6865574755686).
The spelling of 1345322520255 in words is "one trillion, three hundred forty-five billion, three hundred twenty-two million, five hundred twenty thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •