Base | Representation |
---|---|
bin | 1100101000110… |
… | …01111011000001 |
3 | 21101110222121110 |
4 | 12110121323001 |
5 | 204114343403 |
6 | 14304113533 |
7 | 2425042626 |
oct | 624317301 |
9 | 241428543 |
10 | 106012353 |
11 | 54928717 |
12 | 2b6058a9 |
13 | 18c6a305 |
14 | 1011834d |
15 | 9491103 |
hex | 6519ec1 |
106012353 has 4 divisors (see below), whose sum is σ = 141349808. Its totient is φ = 70674900.
The previous prime is 106012339. The next prime is 106012369. The reversal of 106012353 is 353210601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 106012353 - 220 = 104963777 is a prime.
It is a super-2 number, since 2×1060123532 = 22477237977193218, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106012393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17668723 + ... + 17668728.
It is an arithmetic number, because the mean of its divisors is an integer number (35337452).
Almost surely, 2106012353 is an apocalyptic number.
It is an amenable number.
106012353 is a deficient number, since it is larger than the sum of its proper divisors (35337455).
106012353 is an equidigital number, since it uses as much as digits as its factorization.
106012353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35337454.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 106012353 is about 10296.2300382227. The cubic root of 106012353 is about 473.2807327098.
Adding to 106012353 its reverse (353210601), we get a palindrome (459222954).
The spelling of 106012353 in words is "one hundred six million, twelve thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •