Base | Representation |
---|---|
bin | 101100011101001100010… |
… | …001010001011111001101 |
3 | 101211001111022000001012001 |
4 | 230131030101101133031 |
5 | 400023120321001244 |
6 | 10255240453112301 |
7 | 433500531652402 |
oct | 54351421213715 |
9 | 11731438001161 |
10 | 3055001343949 |
11 | a78689684535 |
12 | 4140b5928691 |
13 | 1921157ac139 |
14 | a7c119582a9 |
15 | 547032085d4 |
hex | 2c74c4517cd |
3055001343949 has 2 divisors, whose sum is σ = 3055001343950. Its totient is φ = 3055001343948.
The previous prime is 3055001343929. The next prime is 3055001344009. The reversal of 3055001343949 is 9493431005503.
3055001343949 is digitally balanced in base 2, 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., 2193603890724 + 861397453225 = 1481082^2 + 928115^2 .
It is a cyclic number.
It is not a de Polignac number, because 3055001343949 - 229 = 3054464473037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3055001343899 and 3055001343908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3055001343929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1527500671974 + 1527500671975.
It is an arithmetic number, because the mean of its divisors is an integer number (1527500671975).
Almost surely, 23055001343949 is an apocalyptic number.
It is an amenable number.
3055001343949 is a deficient number, since it is larger than the sum of its proper divisors (1).
3055001343949 is an equidigital number, since it uses as much as digits as its factorization.
3055001343949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 874800, while the sum is 46.
The spelling of 3055001343949 in words is "three trillion, fifty-five billion, one million, three hundred forty-three thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •