Base | Representation |
---|---|
bin | 110011011010110011… |
… | …0110011010101010110 |
3 | 101120000102122112021022 |
4 | 1212311212303111112 |
5 | 3302120240431410 |
6 | 122420545521142 |
7 | 10656223161560 |
oct | 1466546632526 |
9 | 346012575238 |
10 | 110421030230 |
11 | 4291387a385 |
12 | 194979431b2 |
13 | a5497c2814 |
14 | 54b70a0330 |
15 | 2d14062455 |
hex | 19b59b3556 |
110421030230 has 48 divisors (see below), whose sum is σ = 239736477600. Its totient is φ = 35866070784.
The previous prime is 110421030193. The next prime is 110421030323. The reversal of 110421030230 is 32030124011.
110421030230 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 110421030199 and 110421030208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2159555 + ... + 2210094.
It is an arithmetic number, because the mean of its divisors is an integer number (4994509950).
Almost surely, 2110421030230 is an apocalyptic number.
110421030230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110421030230 is an abundant number, since it is smaller than the sum of its proper divisors (129315447370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110421030230 is a wasteful number, since it uses less digits than its factorization.
110421030230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4369701 (or 4369682 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 110421030230 its reverse (32030124011), we get a palindrome (142451154241).
The spelling of 110421030230 in words is "one hundred ten billion, four hundred twenty-one million, thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •