Base | Representation |
---|---|
bin | 1101011001001100110… |
… | …1011100000001101110 |
3 | 210222221021110120022220 |
4 | 3112103031130001232 |
5 | 12232222334240420 |
6 | 253412522420210 |
7 | 22424111366226 |
oct | 3262315340156 |
9 | 728837416286 |
10 | 230103040110 |
11 | 8964a192849 |
12 | 38719061666 |
13 | 18910b50748 |
14 | b1cc0ad086 |
15 | 5ebb153840 |
hex | 359335c06e |
230103040110 has 64 divisors (see below), whose sum is σ = 571410262080. Its totient is φ = 59232481280.
The previous prime is 230103040087. The next prime is 230103040127. The reversal of 230103040110 is 11040301032.
230103040110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 230103040110.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 4551934 + ... + 4602206.
It is an arithmetic number, because the mean of its divisors is an integer number (8928285345).
Almost surely, 2230103040110 is an apocalyptic number.
230103040110 is an abundant number, since it is smaller than the sum of its proper divisors (341307221970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230103040110 is a wasteful number, since it uses less digits than its factorization.
230103040110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55573.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 230103040110 its reverse (11040301032), we get a palindrome (241143341142).
The spelling of 230103040110 in words is "two hundred thirty billion, one hundred three million, forty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •