Base | Representation |
---|---|
bin | 101111010010111101010111… |
… | …001011010101010111011111 |
3 | 1000021111122210220001111222101 |
4 | 233102331113023111113133 |
5 | 204231023034031421341 |
6 | 2014222540045425531 |
7 | 61546205036253304 |
oct | 5722752713252737 |
9 | 1007448726044871 |
10 | 208011023701471 |
11 | 60307a86052671 |
12 | 1b3b5b1ab6b2a7 |
13 | 8c0b480988803 |
14 | 3951b043830ab |
15 | 190ac9dbc6831 |
hex | bd2f572d55df |
208011023701471 has 2 divisors, whose sum is σ = 208011023701472. Its totient is φ = 208011023701470.
The previous prime is 208011023701457. The next prime is 208011023701513. The reversal of 208011023701471 is 174107320110802.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 208011023701471 - 219 = 208011023177183 is a prime.
It is a super-3 number, since 3×2080110237014713 (a number of 44 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 208011023701471.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (208011023701421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 104005511850735 + 104005511850736.
It is an arithmetic number, because the mean of its divisors is an integer number (104005511850736).
Almost surely, 2208011023701471 is an apocalyptic number.
208011023701471 is a deficient number, since it is larger than the sum of its proper divisors (1).
208011023701471 is an equidigital number, since it uses as much as digits as its factorization.
208011023701471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18816, while the sum is 37.
The spelling of 208011023701471 in words is "two hundred eight trillion, eleven billion, twenty-three million, seven hundred one thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •