Base | Representation |
---|---|
bin | 110001011101000110… |
… | …0011000111101110010 |
3 | 101011010110201200020020 |
4 | 1202322030120331302 |
5 | 3220000433302031 |
6 | 120442231224310 |
7 | 10446544551162 |
oct | 1427214307562 |
9 | 334113650206 |
10 | 106203025266 |
11 | 41049925868 |
12 | 186bb218096 |
13 | a0269817b0 |
14 | 51d6bdc5a2 |
15 | 2b68ac8096 |
hex | 18ba318f72 |
106203025266 has 64 divisors (see below), whose sum is σ = 231036624000. Its totient is φ = 32350887936.
The previous prime is 106203025231. The next prime is 106203025273. The reversal of 106203025266 is 662520302601.
It is a super-2 number, since 2×1062030252662 (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 (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16263090 + ... + 16269618.
It is an arithmetic number, because the mean of its divisors is an integer number (3609947250).
Almost surely, 2106203025266 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106203025266, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115518312000).
106203025266 is an abundant number, since it is smaller than the sum of its proper divisors (124833598734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106203025266 is a wasteful number, since it uses less digits than its factorization.
106203025266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8603.
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 106203025266 its reverse (662520302601), we get a palindrome (768723327867).
The spelling of 106203025266 in words is "one hundred six billion, two hundred three million, twenty-five thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •