Base | Representation |
---|---|
bin | 110011110010111010… |
… | …0111001110101001110 |
3 | 101122002210221010202101 |
4 | 1213211310321311032 |
5 | 3310244342030410 |
6 | 123033125345314 |
7 | 11015245453111 |
oct | 1474564716516 |
9 | 348083833671 |
10 | 111230033230 |
11 | 431994aa2a8 |
12 | 1968286823a |
13 | a6482a8514 |
14 | 55526d0578 |
15 | 2d600b6d3a |
hex | 19e5d39d4e |
111230033230 has 8 divisors (see below), whose sum is σ = 200214059832. Its totient is φ = 44492013288.
The previous prime is 111230033209. The next prime is 111230033231. The reversal of 111230033230 is 32330032111.
111230033230 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 = 111230033198 and 111230033207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111230033231) 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, 5561501652 + ... + 5561501671.
It is an arithmetic number, because the mean of its divisors is an integer number (25026757479).
Almost surely, 2111230033230 is an apocalyptic number.
111230033230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111230033230 is a deficient number, since it is larger than the sum of its proper divisors (88984026602).
111230033230 is a wasteful number, since it uses less digits than its factorization.
111230033230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11123003330.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 111230033230 its reverse (32330032111), we get a palindrome (143560065341).
The spelling of 111230033230 in words is "one hundred eleven billion, two hundred thirty million, thirty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •