Base | Representation |
---|---|
bin | 110001001001001100… |
… | …0101101011111100000 |
3 | 101002101221000221010212 |
4 | 1202102120231133200 |
5 | 3212114000311212 |
6 | 120252052513252 |
7 | 10424155053653 |
oct | 1422230553740 |
9 | 332357027125 |
10 | 105535166432 |
11 | 40836939613 |
12 | 1855361b828 |
13 | 9c4b4b6b57 |
14 | 517222d89a |
15 | 2b2a153e22 |
hex | 189262d7e0 |
105535166432 has 24 divisors (see below), whose sum is σ = 207784892952. Its totient is φ = 52764400000.
The previous prime is 105535166393. The next prime is 105535166449. The reversal of 105535166432 is 234661535501.
It is a super-2 number, since 2×1055351664322 (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 105535166432.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 493682 + ... + 674382.
It is an arithmetic number, because the mean of its divisors is an integer number (8657703873).
Almost surely, 2105535166432 is an apocalyptic number.
It is an amenable number.
105535166432 is a deficient number, since it is larger than the sum of its proper divisors (102249726520).
105535166432 is a wasteful number, since it uses less digits than its factorization.
105535166432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198962 (or 198954 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 105535166432 in words is "one hundred five billion, five hundred thirty-five million, one hundred sixty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •