Base | Representation |
---|---|
bin | 110001010111111110… |
… | …1110100010111110001 |
3 | 101010200111211220011120 |
4 | 1202233331310113301 |
5 | 3214123021330301 |
6 | 120413221332453 |
7 | 10442362211601 |
oct | 1425775642761 |
9 | 333614756146 |
10 | 106031433201 |
11 | 40a70a86141 |
12 | 18671867129 |
13 | 9cca262925 |
14 | 51bc0d2c01 |
15 | 2b589d0e36 |
hex | 18aff745f1 |
106031433201 has 8 divisors (see below), whose sum is σ = 143078560800. Its totient is φ = 69835963872.
The previous prime is 106031433191. The next prime is 106031433247. The reversal of 106031433201 is 102334130601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106031433201 - 213 = 106031425009 is a prime.
It is a super-2 number, since 2×1060314332012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106031433901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 212914276 + ... + 212914773.
It is an arithmetic number, because the mean of its divisors is an integer number (17884820100).
Almost surely, 2106031433201 is an apocalyptic number.
It is an amenable number.
106031433201 is a deficient number, since it is larger than the sum of its proper divisors (37047127599).
106031433201 is an equidigital number, since it uses as much as digits as its factorization.
106031433201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425829135.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 106031433201 its reverse (102334130601), we get a palindrome (208365563802).
The spelling of 106031433201 in words is "one hundred six billion, thirty-one million, four hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •