Base | Representation |
---|---|
bin | 110001011101110010… |
… | …0000010110111010011 |
3 | 101011012001222002022122 |
4 | 1202323210002313103 |
5 | 3220022324102121 |
6 | 120444411524455 |
7 | 10450244062643 |
oct | 1427344026723 |
9 | 334161862278 |
10 | 106226003411 |
11 | 4106089a670 |
12 | 18706a5972b |
13 | a02b668628 |
14 | 51d9ca0523 |
15 | 2b6ab165ab |
hex | 18bb902dd3 |
106226003411 has 4 divisors (see below), whose sum is σ = 115882912824. Its totient is φ = 96569094000.
The previous prime is 106226003383. The next prime is 106226003413. The reversal of 106226003411 is 114300622601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 106226003411 - 218 = 106225741267 is a prime.
It is a super-2 number, since 2×1062260034112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106226003413) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 4828454690 + ... + 4828454711.
It is an arithmetic number, because the mean of its divisors is an integer number (28970728206).
Almost surely, 2106226003411 is an apocalyptic number.
106226003411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
106226003411 is a deficient number, since it is larger than the sum of its proper divisors (9656909413).
106226003411 is an equidigital number, since it uses as much as digits as its factorization.
106226003411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9656909412.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 106226003411 in words is "one hundred six billion, two hundred twenty-six million, three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •