Base | Representation |
---|---|
bin | 1011101100101010… |
… | …01111110010001101 |
3 | 121012200101200021212 |
4 | 11312111033302031 |
5 | 100330220422321 |
6 | 2515103304205 |
7 | 311426142164 |
oct | 56625176215 |
9 | 17180350255 |
10 | 6280248461 |
11 | 2733044693 |
12 | 12732ab065 |
13 | 79116c566 |
14 | 4381203db |
15 | 26b54455b |
hex | 17654fc8d |
6280248461 has 2 divisors, whose sum is σ = 6280248462. Its totient is φ = 6280248460.
The previous prime is 6280248433. The next prime is 6280248479. The reversal of 6280248461 is 1648420826.
6280248461 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6098672836 + 181575625 = 78094^2 + 13475^2 .
It is a cyclic number.
It is not a de Polignac number, because 6280248461 - 222 = 6276054157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6280248361) 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, 3140124230 + 3140124231.
It is an arithmetic number, because the mean of its divisors is an integer number (3140124231).
Almost surely, 26280248461 is an apocalyptic number.
It is an amenable number.
6280248461 is a deficient number, since it is larger than the sum of its proper divisors (1).
6280248461 is an equidigital number, since it uses as much as digits as its factorization.
6280248461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 147456, while the sum is 41.
The square root of 6280248461 is about 79248.0186566201. The cubic root of 6280248461 is about 1844.9826023922.
The spelling of 6280248461 in words is "six billion, two hundred eighty million, two hundred forty-eight thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •