Base | Representation |
---|---|
bin | 110000111011011110… |
… | …1011001011100110111 |
3 | 101001012212012011010112 |
4 | 1201312331121130313 |
5 | 3210143201142443 |
6 | 120134254213235 |
7 | 10406566642625 |
oct | 1416675313467 |
9 | 331185164115 |
10 | 105075021623 |
11 | 40620123a50 |
12 | 184454b421b |
13 | 9ba7077710 |
14 | 512b090515 |
15 | 2aeea5eb18 |
hex | 1876f59737 |
105075021623 has 32 divisors (see below), whose sum is σ = 130062965760. Its totient is φ = 83522039040.
The previous prime is 105075021619. The next prime is 105075021629. The reversal of 105075021623 is 326120570501.
It is not a de Polignac number, because 105075021623 - 22 = 105075021619 is a prime.
It is a super-2 number, since 2×1050750216232 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105075021623.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105075021629) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 183683 + ... + 493851.
It is an arithmetic number, because the mean of its divisors is an integer number (4064467680).
Almost surely, 2105075021623 is an apocalyptic number.
105075021623 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
105075021623 is a deficient number, since it is larger than the sum of its proper divisors (24987944137).
105075021623 is a wasteful number, since it uses less digits than its factorization.
105075021623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310319.
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 105075021623 in words is "one hundred five billion, seventy-five million, twenty-one thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •