Base | Representation |
---|---|
bin | 110001000000110110… |
… | …1010001010000010001 |
3 | 101001200102111102201112 |
4 | 1202001231101100101 |
5 | 3211030331434441 |
6 | 120204215143105 |
7 | 10414216440365 |
oct | 1420155212021 |
9 | 331612442645 |
10 | 105255343121 |
11 | 40702996185 |
12 | 18495974a95 |
13 | 9c05531a26 |
14 | 5146dcd2a5 |
15 | 2b107cd4eb |
hex | 1881b51411 |
105255343121 has 2 divisors, whose sum is σ = 105255343122. Its totient is φ = 105255343120.
The previous prime is 105255343117. The next prime is 105255343159. The reversal of 105255343121 is 121343552501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93620700625 + 11634642496 = 305975^2 + 107864^2 .
It is a cyclic number.
It is not a de Polignac number, because 105255343121 - 22 = 105255343117 is a prime.
It is a super-2 number, since 2×1052553431212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105255343021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52627671560 + 52627671561.
It is an arithmetic number, because the mean of its divisors is an integer number (52627671561).
Almost surely, 2105255343121 is an apocalyptic number.
It is an amenable number.
105255343121 is a deficient number, since it is larger than the sum of its proper divisors (1).
105255343121 is an equidigital number, since it uses as much as digits as its factorization.
105255343121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 105255343121 its reverse (121343552501), we get a palindrome (226598895622).
The spelling of 105255343121 in words is "one hundred five billion, two hundred fifty-five million, three hundred forty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •