Base | Representation |
---|---|
bin | 110001011010001101… |
… | …1001100100010100011 |
3 | 101010212201121122020120 |
4 | 1202310123030202203 |
5 | 3214301144240420 |
6 | 120424453011323 |
7 | 10444261120626 |
oct | 1426433144243 |
9 | 333781548216 |
10 | 106106243235 |
11 | 40aaa232013 |
12 | 18692923b43 |
13 | a00c8c6915 |
14 | 51c8007dbd |
15 | 2b6035bd40 |
hex | 18b46cc8a3 |
106106243235 has 16 divisors (see below), whose sum is σ = 169774712736. Its totient is φ = 56588421888.
The previous prime is 106106243227. The next prime is 106106243267. The reversal of 106106243235 is 532342601601.
It is not a de Polignac number, because 106106243235 - 23 = 106106243227 is a prime.
It is a super-2 number, since 2×1061062432352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106106243196 and 106106243205.
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 15 ways as a sum of consecutive naturals, for example, 635007 + ... + 784503.
It is an arithmetic number, because the mean of its divisors is an integer number (10610919546).
Almost surely, 2106106243235 is an apocalyptic number.
106106243235 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106106243235 is a deficient number, since it is larger than the sum of its proper divisors (63668469501).
106106243235 is a wasteful number, since it uses less digits than its factorization.
106106243235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196822.
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 106106243235 its reverse (532342601601), we get a palindrome (638448844836).
The spelling of 106106243235 in words is "one hundred six billion, one hundred six million, two hundred forty-three thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •