Base | Representation |
---|---|
bin | 101111001010001011011… |
… | …0010111101001100001101 |
3 | 211221121212001100121220102 |
4 | 1132110112302331030031 |
5 | 1322143041423400003 |
6 | 21441315440100445 |
7 | 1236162213614036 |
oct | 136242662751415 |
9 | 24847761317812 |
10 | 6481488106253 |
11 | 2079869078106 |
12 | 8881a5304725 |
13 | 3802811bc694 |
14 | 1859c4615a8d |
15 | b38e97ea588 |
hex | 5e516cbd30d |
6481488106253 has 2 divisors, whose sum is σ = 6481488106254. Its totient is φ = 6481488106252.
The previous prime is 6481488106187. The next prime is 6481488106319. The reversal of 6481488106253 is 3526018841846.
It is a balanced prime because it is at equal distance from previous prime (6481488106187) and next prime (6481488106319).
It can be written as a sum of positive squares in only one way, i.e., 6139359039529 + 342129066724 = 2477773^2 + 584918^2 .
It is a cyclic number.
It is not a de Polignac number, because 6481488106253 - 216 = 6481488040717 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6481488100253) 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 as a sum of consecutive naturals, namely, 3240744053126 + 3240744053127.
It is an arithmetic number, because the mean of its divisors is an integer number (3240744053127).
Almost surely, 26481488106253 is an apocalyptic number.
It is an amenable number.
6481488106253 is a deficient number, since it is larger than the sum of its proper divisors (1).
6481488106253 is an equidigital number, since it uses as much as digits as its factorization.
6481488106253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8847360, while the sum is 56.
The spelling of 6481488106253 in words is "six trillion, four hundred eighty-one billion, four hundred eighty-eight million, one hundred six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •