Base | Representation |
---|---|
bin | 1100111010011… |
… | …10000011000011 |
3 | 21112211101020101 |
4 | 12131032003003 |
5 | 210212314021 |
6 | 14425423231 |
7 | 2453505346 |
oct | 635160303 |
9 | 245741211 |
10 | 108323011 |
11 | 56166755 |
12 | 3033ab17 |
13 | 19598c74 |
14 | 1055a45d |
15 | 979aa91 |
hex | 674e0c3 |
108323011 has 4 divisors (see below), whose sum is σ = 108873072. Its totient is φ = 107772952.
The previous prime is 108323003. The next prime is 108323027. The reversal of 108323011 is 110323801.
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 108323011 - 23 = 108323003 is a prime.
It is a super-2 number, since 2×1083230112 = 23467749424212242, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 108323011.
It is not an unprimeable number, because it can be changed into a prime (108323041) 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, 274735 + ... + 275128.
It is an arithmetic number, because the mean of its divisors is an integer number (27218268).
Almost surely, 2108323011 is an apocalyptic number.
108323011 is a deficient number, since it is larger than the sum of its proper divisors (550061).
108323011 is an equidigital number, since it uses as much as digits as its factorization.
108323011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550060.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 108323011 is about 10407.8341166642. The cubic root of 108323011 is about 476.6946097257.
Adding to 108323011 its reverse (110323801), we get a palindrome (218646812).
The spelling of 108323011 in words is "one hundred eight million, three hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •