Base | Representation |
---|---|
bin | 10000010100000100100010… |
… | …000111101001011111010001 |
3 | 100102001001010120002122000022 |
4 | 100110010202013221133101 |
5 | 33401004401241004334 |
6 | 412332324321433225 |
7 | 21053423231641442 |
oct | 2024044207513721 |
9 | 312031116078008 |
10 | 71748001109969 |
11 | 2095217a184028 |
12 | 80692b049b815 |
13 | 3105a66033112 |
14 | 13a089c2572c9 |
15 | 8464e446582e |
hex | 4141221e97d1 |
71748001109969 has 2 divisors, whose sum is σ = 71748001109970. Its totient is φ = 71748001109968.
The previous prime is 71748001109899. The next prime is 71748001110131. The reversal of 71748001109969 is 96990110084717.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70870519282369 + 877481827600 = 8418463^2 + 936740^2 .
It is a cyclic number.
It is not a de Polignac number, because 71748001109969 - 224 = 71747984332753 is a prime.
It is a super-2 number, since 2×717480011099692 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (71748003109969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35874000554984 + 35874000554985.
It is an arithmetic number, because the mean of its divisors is an integer number (35874000554985).
Almost surely, 271748001109969 is an apocalyptic number.
It is an amenable number.
71748001109969 is a deficient number, since it is larger than the sum of its proper divisors (1).
71748001109969 is an equidigital number, since it uses as much as digits as its factorization.
71748001109969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6858432, while the sum is 62.
The spelling of 71748001109969 in words is "seventy-one trillion, seven hundred forty-eight billion, one million, one hundred nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •