Base | Representation |
---|---|
bin | 110011010111111000… |
… | …0111011000111000110 |
3 | 101112202121020002211022 |
4 | 1212233300323013012 |
5 | 3301420143121410 |
6 | 122403125111142 |
7 | 10653623125253 |
oct | 1465760730706 |
9 | 345677202738 |
10 | 110323020230 |
11 | 42873517a85 |
12 | 1946ab584b2 |
13 | a5323c7a37 |
14 | 54a806a42a |
15 | 2d0a652455 |
hex | 19afc3b1c6 |
110323020230 has 8 divisors (see below), whose sum is σ = 198581436432. Its totient is φ = 44129208088.
The previous prime is 110323020221. The next prime is 110323020239. The reversal of 110323020230 is 32020323011.
It is an interprime number because it is at equal distance from previous prime (110323020221) and next prime (110323020239).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 110323020199 and 110323020208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110323020239) 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, 5516151002 + ... + 5516151021.
It is an arithmetic number, because the mean of its divisors is an integer number (24822679554).
Almost surely, 2110323020230 is an apocalyptic number.
110323020230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110323020230 is a deficient number, since it is larger than the sum of its proper divisors (88258416202).
110323020230 is a wasteful number, since it uses less digits than its factorization.
110323020230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11032302030.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 110323020230 its reverse (32020323011), we get a palindrome (142343343241).
The spelling of 110323020230 in words is "one hundred ten billion, three hundred twenty-three million, twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •