Base | Representation |
---|---|
bin | 11000110110110011110000… |
… | …001110011111111000100001 |
3 | 112100001211211120011002111212 |
4 | 120312303300032133320201 |
5 | 103312042403203401431 |
6 | 1024300411420315505 |
7 | 32012035026523223 |
oct | 3066636016377041 |
9 | 470054746132455 |
10 | 109319537950241 |
11 | 31918179244813 |
12 | 10316a380a2b95 |
13 | 48cca32883928 |
14 | 1cdd145808413 |
15 | c989baa5772b |
hex | 636cf039fe21 |
109319537950241 has 2 divisors, whose sum is σ = 109319537950242. Its totient is φ = 109319537950240.
The previous prime is 109319537950177. The next prime is 109319537950291. The reversal of 109319537950241 is 142059735913901.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90166039536400 + 19153498413841 = 9495580^2 + 4376471^2 .
It is a cyclic number.
It is not a de Polignac number, because 109319537950241 - 26 = 109319537950177 is a prime.
It is a super-2 number, since 2×1093195379502412 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (109319537950291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54659768975120 + 54659768975121.
It is an arithmetic number, because the mean of its divisors is an integer number (54659768975121).
Almost surely, 2109319537950241 is an apocalyptic number.
It is an amenable number.
109319537950241 is a deficient number, since it is larger than the sum of its proper divisors (1).
109319537950241 is an equidigital number, since it uses as much as digits as its factorization.
109319537950241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9185400, while the sum is 59.
The spelling of 109319537950241 in words is "one hundred nine trillion, three hundred nineteen billion, five hundred thirty-seven million, nine hundred fifty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •