Base | Representation |
---|---|
bin | 1100000111011110… |
… | …11110100001101101 |
3 | 121210100201211202002 |
4 | 12003233132201231 |
5 | 101310314302042 |
6 | 2553301342045 |
7 | 320130346313 |
oct | 60357364155 |
9 | 17710654662 |
10 | 6505228397 |
11 | 2839039418 |
12 | 1316707925 |
13 | 7c8961895 |
14 | 459d660b3 |
15 | 281185132 |
hex | 183bde86d |
6505228397 has 2 divisors, whose sum is σ = 6505228398. Its totient is φ = 6505228396.
The previous prime is 6505228393. The next prime is 6505228421. The reversal of 6505228397 is 7938225056.
6505228397 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6446644681 + 58583716 = 80291^2 + 7654^2 .
It is a cyclic number.
It is not a de Polignac number, because 6505228397 - 22 = 6505228393 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6505228393) 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, 3252614198 + 3252614199.
It is an arithmetic number, because the mean of its divisors is an integer number (3252614199).
Almost surely, 26505228397 is an apocalyptic number.
It is an amenable number.
6505228397 is a deficient number, since it is larger than the sum of its proper divisors (1).
6505228397 is an equidigital number, since it uses as much as digits as its factorization.
6505228397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 907200, while the sum is 47.
The square root of 6505228397 is about 80654.9961068749. The cubic root of 6505228397 is about 1866.7558302045.
The spelling of 6505228397 in words is "six billion, five hundred five million, two hundred twenty-eight thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •