Base | Representation |
---|---|
bin | 11001010011101001010100… |
… | …011111011010101000010110 |
3 | 112121002021211222222002100022 |
4 | 121103221110133122220112 |
5 | 104042024324201431410 |
6 | 1032415022044145142 |
7 | 32305150331343530 |
oct | 3123512437325026 |
9 | 477067758862308 |
10 | 111301200030230 |
11 | 32511634889901 |
12 | 10596b028381b2 |
13 | 4a14872ba0a52 |
14 | 1d6b014a26850 |
15 | cd02edb7c455 |
hex | 653a547daa16 |
111301200030230 has 64 divisors (see below), whose sum is σ = 238921784110080. Its totient is φ = 36500586993024.
The previous prime is 111301200030203. The next prime is 111301200030233. The reversal of 111301200030230 is 32030002103111.
It is a junction number, because it is equal to n+sod(n) for n = 111301200030199 and 111301200030208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111301200030233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 90315941 + ... + 91539999.
It is an arithmetic number, because the mean of its divisors is an integer number (3733152876720).
Almost surely, 2111301200030230 is an apocalyptic number.
111301200030230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111301200030230 is an abundant number, since it is smaller than the sum of its proper divisors (127620584079850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111301200030230 is a wasteful number, since it uses less digits than its factorization.
111301200030230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1280573.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 111301200030230 its reverse (32030002103111), we get a palindrome (143331202133341).
The spelling of 111301200030230 in words is "one hundred eleven trillion, three hundred one billion, two hundred million, thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •