Base | Representation |
---|---|
bin | 110101001010011010… |
… | …1100111101111110100 |
3 | 101220200102220121010202 |
4 | 1222110311213233310 |
5 | 3332303023442400 |
6 | 124240334340032 |
7 | 11151100656362 |
oct | 1522465475764 |
9 | 356612817122 |
10 | 114166234100 |
11 | 44465954496 |
12 | 1a16205a618 |
13 | a9c56b2799 |
14 | 575064a632 |
15 | 2e82c574d5 |
hex | 1a94d67bf4 |
114166234100 has 72 divisors (see below), whose sum is σ = 253621996320. Its totient is φ = 44583396480.
The previous prime is 114166234099. The next prime is 114166234111. The reversal of 114166234100 is 1432661411.
It is a super-3 number, since 3×1141662341003 (a number of 34 digits) contains 333 as substring.
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, 11574971 + ... + 11584829.
Almost surely, 2114166234100 is an apocalyptic number.
114166234100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114166234100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126810998160).
114166234100 is an abundant number, since it is smaller than the sum of its proper divisors (139455762220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114166234100 is a wasteful number, since it uses less digits than its factorization.
114166234100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12609 (or 12602 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 114166234100 its reverse (1432661411), we get a palindrome (115598895511).
The spelling of 114166234100 in words is "one hundred fourteen billion, one hundred sixty-six million, two hundred thirty-four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •