Base | Representation |
---|---|
bin | 110001000000111010… |
… | …1001001111011100001 |
3 | 101001200120101110022201 |
4 | 1202001311021323201 |
5 | 3211031344112043 |
6 | 120204331333201 |
7 | 10414243140151 |
oct | 1420165117341 |
9 | 331616343281 |
10 | 105257410273 |
11 | 40704078274 |
12 | 184965b1201 |
13 | 9c05aa68b2 |
14 | 51473aa761 |
15 | 2b10a8ac4d |
hex | 1881d49ee1 |
105257410273 has 16 divisors (see below), whose sum is σ = 111833873424. Its totient is φ = 98724003840.
The previous prime is 105257410267. The next prime is 105257410303. The reversal of 105257410273 is 372014752501.
It can be written as a sum of positive squares in 8 ways, for example, as 30287137024 + 74970273249 = 174032^2 + 273807^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105257410273 is a prime.
It is a super-2 number, since 2×1052574102732 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105257410073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18656533 + ... + 18662173.
It is an arithmetic number, because the mean of its divisors is an integer number (6989617089).
Almost surely, 2105257410273 is an apocalyptic number.
It is an amenable number.
105257410273 is a deficient number, since it is larger than the sum of its proper divisors (6576463151).
105257410273 is a wasteful number, since it uses less digits than its factorization.
105257410273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9252.
The product of its (nonzero) digits is 58800, while the sum is 37.
The spelling of 105257410273 in words is "one hundred five billion, two hundred fifty-seven million, four hundred ten thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •