Base | Representation |
---|---|
bin | 110001010111101001… |
… | …0010001000011101010 |
3 | 101010122201100212012200 |
4 | 1202233102101003222 |
5 | 3214112111010422 |
6 | 120412132521030 |
7 | 10442163161421 |
oct | 1425722210352 |
9 | 333581325180 |
10 | 106020016362 |
11 | 40a65598537 |
12 | 18669a80176 |
13 | 9cc7a961c0 |
14 | 51ba7a02b8 |
15 | 2b579c82ac |
hex | 18af4910ea |
106020016362 has 48 divisors (see below), whose sum is σ = 249268507488. Its totient is φ = 32372514720.
The previous prime is 106020016313. The next prime is 106020016387. The reversal of 106020016362 is 263610020601.
106020016362 is a `hidden beast` number, since 1 + 0 + 6 + 0 + 20 + 0 + 1 + 636 + 2 = 666.
It is a super-2 number, since 2×1060200163622 (a number of 23 digits) contains 22 as substring.
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 23 ways as a sum of consecutive naturals, for example, 1698648 + ... + 1759955.
It is an arithmetic number, because the mean of its divisors is an integer number (5193093906).
Almost surely, 2106020016362 is an apocalyptic number.
106020016362 is an abundant number, since it is smaller than the sum of its proper divisors (143248491126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106020016362 is a wasteful number, since it uses less digits than its factorization.
106020016362 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3458755 (or 3458752 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 106020016362 its reverse (263610020601), we get a palindrome (369630036963).
The spelling of 106020016362 in words is "one hundred six billion, twenty million, sixteen thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •