Base | Representation |
---|---|
bin | 1100100001101… |
… | …01011011010001 |
3 | 21022201102202202 |
4 | 12100311123101 |
5 | 203344421213 |
6 | 14232052545 |
7 | 2414064200 |
oct | 620653321 |
9 | 238642682 |
10 | 105076433 |
11 | 54349530 |
12 | 2b234155 |
13 | 18a00307 |
14 | dd53237 |
15 | 9358b58 |
hex | 64356d1 |
105076433 has 24 divisors (see below), whose sum is σ = 133954560. Its totient is φ = 81503520.
The previous prime is 105076429. The next prime is 105076459. The reversal of 105076433 is 334670501.
It is not a de Polignac number, because 105076433 - 22 = 105076429 is a prime.
It is a super-2 number, since 2×1050764332 = 22082113544006978, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105076396 and 105076405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105076333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 206183 + ... + 206691.
It is an arithmetic number, because the mean of its divisors is an integer number (5581440).
Almost surely, 2105076433 is an apocalyptic number.
It is an amenable number.
105076433 is a deficient number, since it is larger than the sum of its proper divisors (28878127).
105076433 is a wasteful number, since it uses less digits than its factorization.
105076433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 917 (or 910 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 29.
The square root of 105076433 is about 10250.6796360046. The cubic root of 105076433 is about 471.8838424903.
The spelling of 105076433 in words is "one hundred five million, seventy-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •