Base | Representation |
---|---|
bin | 1100000001011001… |
… | …01000010011010101 |
3 | 121122210121210211211 |
4 | 12000230220103111 |
5 | 101204230302412 |
6 | 2544234501421 |
7 | 315640241614 |
oct | 60054502325 |
9 | 17583553754 |
10 | 6454150357 |
11 | 2812221766 |
12 | 1301594871 |
13 | 7bb1b98a5 |
14 | 45326b87b |
15 | 27b945ca7 |
hex | 180b284d5 |
6454150357 has 2 divisors, whose sum is σ = 6454150358. Its totient is φ = 6454150356.
The previous prime is 6454150291. The next prime is 6454150397. The reversal of 6454150357 is 7530514546.
It is an a-pointer prime, because the next prime (6454150397) can be obtained adding 6454150357 to its sum of digits (40).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5415635281 + 1038515076 = 73591^2 + 32226^2 .
It is a cyclic number.
It is not a de Polignac number, because 6454150357 - 227 = 6319932629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6454150397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3227075178 + 3227075179.
It is an arithmetic number, because the mean of its divisors is an integer number (3227075179).
Almost surely, 26454150357 is an apocalyptic number.
It is an amenable number.
6454150357 is a deficient number, since it is larger than the sum of its proper divisors (1).
6454150357 is an equidigital number, since it uses as much as digits as its factorization.
6454150357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252000, while the sum is 40.
The square root of 6454150357 is about 80337.7268598011. The cubic root of 6454150357 is about 1861.8571612236.
The spelling of 6454150357 in words is "six billion, four hundred fifty-four million, one hundred fifty thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •