Base | Representation |
---|---|
bin | 110011010111010100… |
… | …0011111000111111110 |
3 | 101112201021111100211000 |
4 | 1212232220133013332 |
5 | 3301400312444410 |
6 | 122401210111130 |
7 | 10653302536611 |
oct | 1465650370776 |
9 | 345637440730 |
10 | 110304031230 |
11 | 42863828298 |
12 | 1946471b4a6 |
13 | a52b4a9843 |
14 | 54a5726178 |
15 | 2d08b50dc0 |
hex | 19aea1f1fe |
110304031230 has 32 divisors (see below), whose sum is σ = 294144084000. Its totient is φ = 29414408256.
The previous prime is 110304031199. The next prime is 110304031273. The reversal of 110304031230 is 32130403011.
110304031230 is a `hidden beast` number, since 1 + 1 + 0 + 30 + 403 + 1 + 230 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 204266455 + ... + 204266994.
It is an arithmetic number, because the mean of its divisors is an integer number (9192002625).
Almost surely, 2110304031230 is an apocalyptic number.
110304031230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110304031230 is an abundant number, since it is smaller than the sum of its proper divisors (183840052770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110304031230 is a wasteful number, since it uses less digits than its factorization.
110304031230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408533465 (or 408533459 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 110304031230 its reverse (32130403011), we get a palindrome (142434434241).
The spelling of 110304031230 in words is "one hundred ten billion, three hundred four million, thirty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •