Base | Representation |
---|---|
bin | 110000111001010001… |
… | …1001111011100110101 |
3 | 101001000201000022102222 |
4 | 1201302203033130311 |
5 | 3210020232243203 |
6 | 120123053012125 |
7 | 10405011151565 |
oct | 1416243173465 |
9 | 331021008388 |
10 | 105001056053 |
11 | 405923a4583 |
12 | 18424784045 |
13 | 9b9494abca |
14 | 5121318da5 |
15 | 2ae82ee038 |
hex | 18728cf735 |
105001056053 has 8 divisors (see below), whose sum is σ = 113275280088. Its totient is φ = 96959908864.
The previous prime is 105001056037. The next prime is 105001056077. The reversal of 105001056053 is 350650100501.
It can be written as a sum of positive squares in 4 ways, for example, as 52705598929 + 52295457124 = 229577^2 + 228682^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105001056053 - 24 = 105001056037 is a prime.
It is a super-2 number, since 2×1050010560532 (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 (105001076053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58268276 + ... + 58270077.
It is an arithmetic number, because the mean of its divisors is an integer number (14159410011).
Almost surely, 2105001056053 is an apocalyptic number.
It is an amenable number.
105001056053 is a deficient number, since it is larger than the sum of its proper divisors (8274224035).
105001056053 is a wasteful number, since it uses less digits than its factorization.
105001056053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116538423.
The product of its (nonzero) digits is 2250, while the sum is 26.
Adding to 105001056053 its reverse (350650100501), we get a palindrome (455651156554).
The spelling of 105001056053 in words is "one hundred five billion, one million, fifty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •