Base | Representation |
---|---|
bin | 1100000000011100… |
… | …00101111101110101 |
3 | 121122020120010002211 |
4 | 12000032011331311 |
5 | 101200203123042 |
6 | 2543351133421 |
7 | 315512221546 |
oct | 60016057565 |
9 | 17566503084 |
10 | 6446145397 |
11 | 280875449a |
12 | 12ba974271 |
13 | 7b9646123 |
14 | 4521864cd |
15 | 27adb4017 |
hex | 180385f75 |
6446145397 has 2 divisors, whose sum is σ = 6446145398. Its totient is φ = 6446145396.
The previous prime is 6446145367. The next prime is 6446145401. The reversal of 6446145397 is 7935416446.
6446145397 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., 6445841796 + 303601 = 80286^2 + 551^2 .
It is a cyclic number.
It is not a de Polignac number, because 6446145397 - 227 = 6311927669 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6446145397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6446145367) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3223072698 + 3223072699.
It is an arithmetic number, because the mean of its divisors is an integer number (3223072699).
Almost surely, 26446145397 is an apocalyptic number.
It is an amenable number.
6446145397 is a deficient number, since it is larger than the sum of its proper divisors (1).
6446145397 is an equidigital number, since it uses as much as digits as its factorization.
6446145397 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2177280, while the sum is 49.
The square root of 6446145397 is about 80287.8907245669. The cubic root of 6446145397 is about 1861.0871007571.
The spelling of 6446145397 in words is "six billion, four hundred forty-six million, one hundred forty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •