Base | Representation |
---|---|
bin | 1001110001111000111000… |
… | …1010001010110000001001 |
3 | 1102001221120022211002222121 |
4 | 2130132032022022300021 |
5 | 2402133001133001131 |
6 | 34511414452451241 |
7 | 2156566431264664 |
oct | 234361612126011 |
9 | 42057508732877 |
10 | 10752688172041 |
11 | 347620a173152 |
12 | 1257b39619b21 |
13 | 5ccc8826a00a |
14 | 29260bb986db |
15 | 139a7e88a911 |
hex | 9c78e28ac09 |
10752688172041 has 2 divisors, whose sum is σ = 10752688172042. Its totient is φ = 10752688172040.
The previous prime is 10752688171987. The next prime is 10752688172053. The reversal of 10752688172041 is 14027188625701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9895019553225 + 857668618816 = 3145635^2 + 926104^2 .
It is a cyclic number.
It is not a de Polignac number, because 10752688172041 - 227 = 10752553954313 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10752688172041.
It is not a weakly prime, because it can be changed into another prime (10752688172641) 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, 5376344086020 + 5376344086021.
It is an arithmetic number, because the mean of its divisors is an integer number (5376344086021).
Almost surely, 210752688172041 is an apocalyptic number.
It is an amenable number.
10752688172041 is a deficient number, since it is larger than the sum of its proper divisors (1).
10752688172041 is an equidigital number, since it uses as much as digits as its factorization.
10752688172041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1505280, while the sum is 52.
The spelling of 10752688172041 in words is "ten trillion, seven hundred fifty-two billion, six hundred eighty-eight million, one hundred seventy-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •