Base | Representation |
---|---|
bin | 110001000011110111… |
… | …0001111110000111101 |
3 | 101001221110101200000212 |
4 | 1202013232033300331 |
5 | 3211232200344321 |
6 | 120222222202205 |
7 | 10416553312022 |
oct | 1420756176075 |
9 | 331843350025 |
10 | 105356262461 |
11 | 4075495539a |
12 | 18503723365 |
13 | 9c20407b08 |
14 | 515657d549 |
15 | 2b195b555b |
hex | 1887b8fc3d |
105356262461 has 4 divisors (see below), whose sum is σ = 108203729052. Its totient is φ = 102508795872.
The previous prime is 105356262457. The next prime is 105356262481. The reversal of 105356262461 is 164262653501.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 62177916025 + 43178346436 = 249355^2 + 207794^2 .
It is a cyclic number.
It is not a de Polignac number, because 105356262461 - 22 = 105356262457 is a prime.
It is a super-2 number, since 2×1053562624612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105356262421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1423733240 + ... + 1423733313.
It is an arithmetic number, because the mean of its divisors is an integer number (27050932263).
Almost surely, 2105356262461 is an apocalyptic number.
It is an amenable number.
105356262461 is a deficient number, since it is larger than the sum of its proper divisors (2847466591).
105356262461 is an equidigital number, since it uses as much as digits as its factorization.
105356262461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2847466590.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 105356262461 in words is "one hundred five billion, three hundred fifty-six million, two hundred sixty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •