Base | Representation |
---|---|
bin | 10011100100110111001… |
… | …110100000001101000011 |
3 | 11202121022212200022011101 |
4 | 103210313032200031003 |
5 | 134020033313444301 |
6 | 2505555552155231 |
7 | 166122403326124 |
oct | 23446716401503 |
9 | 4677285608141 |
10 | 1345251312451 |
11 | 479577327a82 |
12 | 198875b38b17 |
13 | 99b1a0ba477 |
14 | 4917935604b |
15 | 24ed6956701 |
hex | 139373a0343 |
1345251312451 has 2 divisors, whose sum is σ = 1345251312452. Its totient is φ = 1345251312450.
The previous prime is 1345251312367. The next prime is 1345251312473. The reversal of 1345251312451 is 1542131525431.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1345251312451 - 237 = 1207812358979 is a prime.
It is a super-2 number, since 2×13452513124512 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1345251312451.
It is not a weakly prime, because it can be changed into another prime (1345251312151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 672625656225 + 672625656226.
It is an arithmetic number, because the mean of its divisors is an integer number (672625656226).
Almost surely, 21345251312451 is an apocalyptic number.
1345251312451 is a deficient number, since it is larger than the sum of its proper divisors (1).
1345251312451 is an equidigital number, since it uses as much as digits as its factorization.
1345251312451 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72000, while the sum is 37.
Adding to 1345251312451 its reverse (1542131525431), we get a palindrome (2887382837882).
The spelling of 1345251312451 in words is "one trillion, three hundred forty-five billion, two hundred fifty-one million, three hundred twelve thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •