Base | Representation |
---|---|
bin | 10111100001011101001110… |
… | …111111011010100110110011 |
3 | 111120022010101020201202022221 |
4 | 113201131032333122212303 |
5 | 102024443201320140101 |
6 | 1004010112102141511 |
7 | 30535214403041224 |
oct | 2741351677324663 |
9 | 446263336652287 |
10 | 103454202505651 |
11 | 2aa667542a5a68 |
12 | b72a14b121897 |
13 | 45958c68c921a |
14 | 1b792d27c724b |
15 | be61341c8aa1 |
hex | 5e174efda9b3 |
103454202505651 has 2 divisors, whose sum is σ = 103454202505652. Its totient is φ = 103454202505650.
The previous prime is 103454202505579. The next prime is 103454202505679. The reversal of 103454202505651 is 156505202454301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103454202505651 - 219 = 103454201981363 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103454202505598 and 103454202505607.
It is not a weakly prime, because it can be changed into another prime (103454202505051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51727101252825 + 51727101252826.
It is an arithmetic number, because the mean of its divisors is an integer number (51727101252826).
Almost surely, 2103454202505651 is an apocalyptic number.
103454202505651 is a deficient number, since it is larger than the sum of its proper divisors (1).
103454202505651 is an equidigital number, since it uses as much as digits as its factorization.
103454202505651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720000, while the sum is 43.
Adding to 103454202505651 its reverse (156505202454301), we get a palindrome (259959404959952).
The spelling of 103454202505651 in words is "one hundred three trillion, four hundred fifty-four billion, two hundred two million, five hundred five thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •