Base | Representation |
---|---|
bin | 110001000001111110… |
… | …1000000111100000111 |
3 | 101001210001101212120211 |
4 | 1202003331000330013 |
5 | 3211120003300111 |
6 | 120212042540251 |
7 | 10415154642235 |
oct | 1420375007407 |
9 | 331701355524 |
10 | 105293025031 |
11 | 40722193157 |
12 | 184a6507687 |
13 | 9c1029640c |
14 | 514bddb955 |
15 | 2b13c73521 |
hex | 1883f40f07 |
105293025031 has 8 divisors (see below), whose sum is σ = 105667210640. Its totient is φ = 104919409728.
The previous prime is 105293024923. The next prime is 105293025049. The reversal of 105293025031 is 130520392501.
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 105293025031 - 213 = 105293016839 is a prime.
It is a super-2 number, since 2×1052930250312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105293024984 and 105293025002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105293020031) 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 7 ways as a sum of consecutive naturals, for example, 229045 + ... + 512881.
It is an arithmetic number, because the mean of its divisors is an integer number (13208401330).
Almost surely, 2105293025031 is an apocalyptic number.
105293025031 is a deficient number, since it is larger than the sum of its proper divisors (374185609).
105293025031 is an equidigital number, since it uses as much as digits as its factorization.
105293025031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285153.
The product of its (nonzero) digits is 8100, while the sum is 31.
The spelling of 105293025031 in words is "one hundred five billion, two hundred ninety-three million, twenty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •