Base | Representation |
---|---|
bin | 1011011000011110… |
… | …0110000000100001 |
3 | 21212221100122012122 |
4 | 2312013212000201 |
5 | 22224143202001 |
6 | 1223104434025 |
7 | 135500563001 |
oct | 26607460041 |
9 | 7787318178 |
10 | 3055444001 |
11 | 132879a335 |
12 | 713318915 |
13 | 39902783c |
14 | 20db1a001 |
15 | 12d396b1b |
hex | b61e6021 |
3055444001 has 2 divisors, whose sum is σ = 3055444002. Its totient is φ = 3055444000.
The previous prime is 3055443997. The next prime is 3055444027. The reversal of 3055444001 is 1004445503.
It is an a-pointer prime, because the next prime (3055444027) can be obtained adding 3055444001 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3005670976 + 49773025 = 54824^2 + 7055^2 .
It is a cyclic number.
It is not a de Polignac number, because 3055444001 - 22 = 3055443997 is a prime.
It is not a weakly prime, because it can be changed into another prime (3055444501) 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, 1527722000 + 1527722001.
It is an arithmetic number, because the mean of its divisors is an integer number (1527722001).
Almost surely, 23055444001 is an apocalyptic number.
It is an amenable number.
3055444001 is a deficient number, since it is larger than the sum of its proper divisors (1).
3055444001 is an equidigital number, since it uses as much as digits as its factorization.
3055444001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 26.
The square root of 3055444001 is about 55276.0707811255. The cubic root of 3055444001 is about 1451.0802890500.
Adding to 3055444001 its reverse (1004445503), we get a palindrome (4059889504).
The spelling of 3055444001 in words is "three billion, fifty-five million, four hundred forty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •