Base | Representation |
---|---|
bin | 1100101101101… |
… | …00011110111001 |
3 | 21102200011000212 |
4 | 12112310132321 |
5 | 204300123213 |
6 | 14325440505 |
7 | 2433320426 |
oct | 626643671 |
9 | 242604025 |
10 | 106645433 |
11 | 55220324 |
12 | 2b870135 |
13 | 1912c50b |
14 | 10240d4d |
15 | 95689a8 |
hex | 65b47b9 |
106645433 has 4 divisors (see below), whose sum is σ = 109527780. Its totient is φ = 103763088.
The previous prime is 106645421. The next prime is 106645439. The reversal of 106645433 is 334546601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 102657424 + 3988009 = 10132^2 + 1997^2 .
It is a cyclic number.
It is not a de Polignac number, because 106645433 - 24 = 106645417 is a prime.
It is a super-2 number, since 2×1066454332 = 22746496759514978, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 106645433.
It is not an unprimeable number, because it can be changed into a prime (106645439) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1441118 + ... + 1441191.
It is an arithmetic number, because the mean of its divisors is an integer number (27381945).
Almost surely, 2106645433 is an apocalyptic number.
It is an amenable number.
106645433 is a deficient number, since it is larger than the sum of its proper divisors (2882347).
106645433 is an equidigital number, since it uses as much as digits as its factorization.
106645433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2882346.
The product of its (nonzero) digits is 25920, while the sum is 32.
The square root of 106645433 is about 10326.9275682557. The cubic root of 106645433 is about 474.2209693908.
The spelling of 106645433 in words is "one hundred six million, six hundred forty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •