Base | Representation |
---|---|
bin | 1100000000011011… |
… | …01111111111100101 |
3 | 121122020101112122111 |
4 | 12000031233333211 |
5 | 101200142233042 |
6 | 2543345201021 |
7 | 315511365265 |
oct | 60015577745 |
9 | 17566345574 |
10 | 6446055397 |
11 | 28086a2911 |
12 | 12ba930171 |
13 | 7b9614182 |
14 | 4521617a5 |
15 | 27ad97517 |
hex | 18036ffe5 |
6446055397 has 2 divisors, whose sum is σ = 6446055398. Its totient is φ = 6446055396.
The previous prime is 6446055391. The next prime is 6446055439. The reversal of 6446055397 is 7935506446.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6374585281 + 71470116 = 79841^2 + 8454^2 .
It is a cyclic number.
It is not a de Polignac number, because 6446055397 - 23 = 6446055389 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6446055397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6446055391) 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, 3223027698 + 3223027699.
It is an arithmetic number, because the mean of its divisors is an integer number (3223027699).
Almost surely, 26446055397 is an apocalyptic number.
It is an amenable number.
6446055397 is a deficient number, since it is larger than the sum of its proper divisors (1).
6446055397 is an equidigital number, since it uses as much as digits as its factorization.
6446055397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2721600, while the sum is 49.
The square root of 6446055397 is about 80287.3302395839. The cubic root of 6446055397 is about 1861.0784393216.
The spelling of 6446055397 in words is "six billion, four hundred forty-six million, fifty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •