Base | Representation |
---|---|
bin | 110001010110010010… |
… | …1110010011000111110 |
3 | 101010112120021201202000 |
4 | 1202230211302120332 |
5 | 3214014022130412 |
6 | 120403435443130 |
7 | 10441103645160 |
oct | 1425445623076 |
9 | 333476251660 |
10 | 105974801982 |
11 | 40a42016285 |
12 | 186568b64a6 |
13 | 9cbb5c512a |
14 | 51b4790930 |
15 | 2b53a464dc |
hex | 18ac97263e |
105974801982 has 32 divisors (see below), whose sum is σ = 269142355200. Its totient is φ = 30278514744.
The previous prime is 105974801957. The next prime is 105974802049. The reversal of 105974801982 is 289108479501.
It is a happy number.
105974801982 is a `hidden beast` number, since 1 + 0 + 597 + 48 + 0 + 1 + 9 + 8 + 2 = 666.
It is a super-2 number, since 2×1059748019822 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 140177932 + ... + 140178687.
It is an arithmetic number, because the mean of its divisors is an integer number (8410698600).
Almost surely, 2105974801982 is an apocalyptic number.
105974801982 is an abundant number, since it is smaller than the sum of its proper divisors (163167553218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105974801982 is a wasteful number, since it uses less digits than its factorization.
105974801982 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280356637 (or 280356631 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 54.
The spelling of 105974801982 in words is "one hundred five billion, nine hundred seventy-four million, eight hundred one thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •