Base | Representation |
---|---|
bin | 110011111000010110… |
… | …0010010010100101110 |
3 | 101122120111221110011200 |
4 | 1213300230102110232 |
5 | 3311133023324010 |
6 | 123103200430330 |
7 | 11022621061026 |
oct | 1476054222456 |
9 | 348514843150 |
10 | 111412323630 |
11 | 43282396823 |
12 | 197139183a6 |
13 | a676ca1a6a |
14 | 556c9c2a86 |
15 | 2d710c3cc0 |
hex | 19f0b1252e |
111412323630 has 48 divisors (see below), whose sum is σ = 291142504224. Its totient is φ = 29559136320.
The previous prime is 111412323571. The next prime is 111412323641. The reversal of 111412323630 is 36323214111.
It is a happy number.
111412323630 is a `hidden beast` number, since 1 + 1 + 1 + 4 + 1 + 2 + 3 + 23 + 630 = 666.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 111412323594 and 111412323603.
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, 3124186 + ... + 3159645.
It is an arithmetic number, because the mean of its divisors is an integer number (6065468838).
Almost surely, 2111412323630 is an apocalyptic number.
111412323630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111412323630 is an abundant number, since it is smaller than the sum of its proper divisors (179730180594).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111412323630 is a wasteful number, since it uses less digits than its factorization.
111412323630 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6284041 (or 6284038 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 111412323630 its reverse (36323214111), we get a palindrome (147735537741).
The spelling of 111412323630 in words is "one hundred eleven billion, four hundred twelve million, three hundred twenty-three thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •