Base | Representation |
---|---|
bin | 110001100001110110… |
… | …0001010101101101011 |
3 | 101011112120112020021201 |
4 | 1203003230022231223 |
5 | 3220312230203233 |
6 | 120510122145031 |
7 | 10453521030106 |
oct | 1430354125553 |
9 | 334476466251 |
10 | 106362350443 |
11 | 41120857168 |
12 | 18744652177 |
13 | a05099704b |
14 | 521003373d |
15 | 2b77a9a77d |
hex | 18c3b0ab6b |
106362350443 has 4 divisors (see below), whose sum is σ = 106376384448. Its totient is φ = 106348316440.
The previous prime is 106362350441. The next prime is 106362350447. The reversal of 106362350443 is 344053263601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 344053263601 = 641 ⋅536744561.
It is a cyclic number.
It is not a de Polignac number, because 106362350443 - 21 = 106362350441 is a prime.
It is a super-2 number, since 2×1063623504432 (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 (106362350441) 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, 7005628 + ... + 7020793.
It is an arithmetic number, because the mean of its divisors is an integer number (26594096112).
Almost surely, 2106362350443 is an apocalyptic number.
106362350443 is a deficient number, since it is larger than the sum of its proper divisors (14034005).
106362350443 is an equidigital number, since it uses as much as digits as its factorization.
106362350443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14034004.
The product of its (nonzero) digits is 155520, while the sum is 37.
The spelling of 106362350443 in words is "one hundred six billion, three hundred sixty-two million, three hundred fifty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •