Base | Representation |
---|---|
bin | 101101010011101000010… |
… | …000110101100001111001 |
3 | 102000122100220012100220002 |
4 | 231103220100311201321 |
5 | 402002322440044402 |
6 | 10342144532042345 |
7 | 440640161161454 |
oct | 55235020654171 |
9 | 12018326170802 |
10 | 3113453049977 |
11 | aa04540963a6 |
12 | 4234a91633b5 |
13 | 19779c53833a |
14 | aa99893649b |
15 | 55ec4a72602 |
hex | 2d4e8435879 |
3113453049977 has 2 divisors, whose sum is σ = 3113453049978. Its totient is φ = 3113453049976.
The previous prime is 3113453049937. The next prime is 3113453050033. The reversal of 3113453049977 is 7799403543113.
It is an a-pointer prime, because the next prime (3113453050033) can be obtained adding 3113453049977 to its sum of digits (56).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1959227276176 + 1154225773801 = 1399724^2 + 1074349^2 .
It is a cyclic number.
It is not a de Polignac number, because 3113453049977 - 240 = 2013941422201 is a prime.
It is a super-2 number, since 2×31134530499772 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3113453049937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1556726524988 + 1556726524989.
It is an arithmetic number, because the mean of its divisors is an integer number (1556726524989).
Almost surely, 23113453049977 is an apocalyptic number.
It is an amenable number.
3113453049977 is a deficient number, since it is larger than the sum of its proper divisors (1).
3113453049977 is an equidigital number, since it uses as much as digits as its factorization.
3113453049977 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8573040, while the sum is 56.
The spelling of 3113453049977 in words is "three trillion, one hundred thirteen billion, four hundred fifty-three million, forty-nine thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •