Base | Representation |
---|---|
bin | 110001011001101011… |
… | …1000100010111001110 |
3 | 101010211111000021220120 |
4 | 1202303113010113032 |
5 | 3214232111241300 |
6 | 120423014125410 |
7 | 10443653246013 |
oct | 1426327042716 |
9 | 333744007816 |
10 | 106088383950 |
11 | 40aa014407a |
12 | 18688950866 |
13 | a008cb29b3 |
14 | 51c58b970a |
15 | 2b5d9d03a0 |
hex | 18b35c45ce |
106088383950 has 24 divisors (see below), whose sum is σ = 263099192568. Its totient is φ = 28290235680.
The previous prime is 106088383949. The next prime is 106088383993. The reversal of 106088383950 is 59383880601.
It is a super-2 number, since 2×1060883839502 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106088383893 and 106088383902.
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 11 ways as a sum of consecutive naturals, for example, 353627797 + ... + 353628096.
It is an arithmetic number, because the mean of its divisors is an integer number (10962466357).
Almost surely, 2106088383950 is an apocalyptic number.
106088383950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106088383950 is an abundant number, since it is smaller than the sum of its proper divisors (157010808618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106088383950 is a wasteful number, since it uses less digits than its factorization.
106088383950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707255908 (or 707255903 counting only the distinct ones).
The product of its (nonzero) digits is 1244160, while the sum is 51.
The spelling of 106088383950 in words is "one hundred six billion, eighty-eight million, three hundred eighty-three thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •