Base | Representation |
---|---|
bin | 110001000010001111… |
… | …1010011010010110001 |
3 | 101001210200022111220110 |
4 | 1202010133103102301 |
5 | 3211124303404410 |
6 | 120213003331533 |
7 | 10415324225442 |
oct | 1420437232261 |
9 | 331720274813 |
10 | 105302013105 |
11 | 40727272013 |
12 | 184a9520ba9 |
13 | 9c120c24c3 |
14 | 514d29b2c9 |
15 | 2b1494b720 |
hex | 18847d34b1 |
105302013105 has 16 divisors (see below), whose sum is σ = 178393999104. Its totient is φ = 52857480960.
The previous prime is 105302013101. The next prime is 105302013133. The reversal of 105302013105 is 501310203501.
It is not a de Polignac number, because 105302013105 - 22 = 105302013101 is a prime.
It is a super-2 number, since 2×1053020131052 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105302013101) 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, 206474281 + ... + 206474790.
It is an arithmetic number, because the mean of its divisors is an integer number (11149624944).
Almost surely, 2105302013105 is an apocalyptic number.
105302013105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105302013105 is a deficient number, since it is larger than the sum of its proper divisors (73091985999).
105302013105 is a wasteful number, since it uses less digits than its factorization.
105302013105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412949096.
The product of its (nonzero) digits is 450, while the sum is 21.
Adding to 105302013105 its reverse (501310203501), we get a palindrome (606612216606).
The spelling of 105302013105 in words is "one hundred five billion, three hundred two million, thirteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •