Base | Representation |
---|---|
bin | 110011111000101100… |
… | …1101000010100110110 |
3 | 101122121100022100112010 |
4 | 1213301121220110312 |
5 | 3311144044211410 |
6 | 123104303305050 |
7 | 11023124105604 |
oct | 1476131502466 |
9 | 348540270463 |
10 | 111424210230 |
11 | 43289075363 |
12 | 197178ab186 |
13 | a6795a4258 |
14 | 55703d8874 |
15 | 2d72170c20 |
hex | 19f1668536 |
111424210230 has 32 divisors (see below), whose sum is σ = 267442192224. Its totient is φ = 29710446336.
The previous prime is 111424210199. The next prime is 111424210231. The reversal of 111424210230 is 32012424111.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 111424210197 and 111424210206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111424210231) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 183384 + ... + 506436.
It is an arithmetic number, because the mean of its divisors is an integer number (8357568507).
Almost surely, 2111424210230 is an apocalyptic number.
111424210230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111424210230 is an abundant number, since it is smaller than the sum of its proper divisors (156017981994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111424210230 is a wasteful number, since it uses less digits than its factorization.
111424210230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334560.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 111424210230 its reverse (32012424111), we get a palindrome (143436634341).
The spelling of 111424210230 in words is "one hundred eleven billion, four hundred twenty-four million, two hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •