Base | Representation |
---|---|
bin | 11000010100110011011011… |
… | …110101011111111001001010 |
3 | 112000210110010122120201002210 |
4 | 120110303123311133321022 |
5 | 103010301114303041323 |
6 | 1015311104522205550 |
7 | 31351150604613300 |
oct | 3024633365377112 |
9 | 460713118521083 |
10 | 106982733643338 |
11 | 310a7139120173 |
12 | bbb9b790538b6 |
13 | 479057552c787 |
14 | 1c5bdc5c32270 |
15 | c57cee231293 |
hex | 614cdbd5fe4a |
106982733643338 has 96 divisors (see below), whose sum is σ = 249548402664000. Its totient is φ = 30486752061696.
The previous prime is 106982733643273. The next prime is 106982733643361. The reversal of 106982733643338 is 833346337289601.
It is a super-2 number, since 2×1069827336433382 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 320814613 + ... + 321147911.
It is an arithmetic number, because the mean of its divisors is an integer number (2599462527750).
Almost surely, 2106982733643338 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106982733643338, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124774201332000).
106982733643338 is an abundant number, since it is smaller than the sum of its proper divisors (142565669020662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106982733643338 is a wasteful number, since it uses less digits than its factorization.
106982733643338 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336164 (or 336157 counting only the distinct ones).
The product of its (nonzero) digits is 282175488, while the sum is 66.
The spelling of 106982733643338 in words is "one hundred six trillion, nine hundred eighty-two billion, seven hundred thirty-three million, six hundred forty-three thousand, three hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •