Base | Representation |
---|---|
bin | 10110101010111100… |
… | …11110100011111100 |
3 | 1011102020202210110221 |
4 | 23111132132203330 |
5 | 144411344033400 |
6 | 5331432511124 |
7 | 610422540325 |
oct | 132536364374 |
9 | 34366683427 |
10 | 12171471100 |
11 | 5186529428 |
12 | 243824b4a4 |
13 | 11bc840609 |
14 | 8366d544c |
15 | 4b3841c1a |
hex | 2d579e8fc |
12171471100 has 72 divisors (see below), whose sum is σ = 28204444800. Its totient is φ = 4549036800.
The previous prime is 12171471061. The next prime is 12171471121. The reversal of 12171471100 is 117417121.
It is a Harshad number since it is a multiple of its sum of digits (25).
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, 22206 + ... + 157594.
It is an arithmetic number, because the mean of its divisors is an integer number (391728400).
Almost surely, 212171471100 is an apocalyptic number.
12171471100 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 12171471100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14102222400).
12171471100 is an abundant number, since it is smaller than the sum of its proper divisors (16032973700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12171471100 is a wasteful number, since it uses less digits than its factorization.
12171471100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135463 (or 135456 counting only the distinct ones).
The product of its (nonzero) digits is 392, while the sum is 25.
Adding to 12171471100 its reverse (117417121), we get a palindrome (12288888221).
The spelling of 12171471100 in words is "twelve billion, one hundred seventy-one million, four hundred seventy-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •