Base | Representation |
---|---|
bin | 10111111000010010100111… |
… | …011110001110101000110111 |
3 | 111202212010121211122122110112 |
4 | 113320102213132032220313 |
5 | 102231200310102304033 |
6 | 1011211021055413235 |
7 | 31056454343032202 |
oct | 2770224736165067 |
9 | 452763554578415 |
10 | 105023350041143 |
11 | 305111751661a6 |
12 | b94228b52421b |
13 | 467a8759681b1 |
14 | 1bd122b764939 |
15 | c21d71de6c48 |
hex | 5f84a778ea37 |
105023350041143 has 2 divisors, whose sum is σ = 105023350041144. Its totient is φ = 105023350041142.
The previous prime is 105023350041097. The next prime is 105023350041157. The reversal of 105023350041143 is 341140053320501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105023350041143 - 230 = 105022276299319 is a prime.
It is a super-2 number, since 2×1050233500411432 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105023350044143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52511675020571 + 52511675020572.
It is an arithmetic number, because the mean of its divisors is an integer number (52511675020572).
Almost surely, 2105023350041143 is an apocalyptic number.
105023350041143 is a deficient number, since it is larger than the sum of its proper divisors (1).
105023350041143 is an equidigital number, since it uses as much as digits as its factorization.
105023350041143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 32.
The spelling of 105023350041143 in words is "one hundred five trillion, twenty-three billion, three hundred fifty million, forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •