Base | Representation |
---|---|
bin | 10111001100011101010111… |
… | …010000010001011110111000 |
3 | 111101012011211011101202100122 |
4 | 113030131113100101132320 |
5 | 101332323000411143000 |
6 | 1000543151343152412 |
7 | 30326032300163033 |
oct | 2714352720213670 |
9 | 441164734352318 |
10 | 102011232131000 |
11 | 2a55a7a2124255 |
12 | b5365632a5708 |
13 | 44bc80572bb7a |
14 | 1b2952731a01a |
15 | bbd82d8e1085 |
hex | 5cc7574117b8 |
102011232131000 has 32 divisors (see below), whose sum is σ = 238706283188880. Its totient is φ = 40804492852000.
The previous prime is 102011232130967. The next prime is 102011232131021. The reversal of 102011232131000 is 131232110201.
It is a super-2 number, since 2×1020112321310002 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102011232131000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51005615066 + ... + 51005617065.
Almost surely, 2102011232131000 is an apocalyptic number.
102011232131000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102011232131000 is an abundant number, since it is smaller than the sum of its proper divisors (136695051057880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011232131000 is a wasteful number, since it uses less digits than its factorization.
102011232131000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102011232152 (or 102011232138 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 102011232131000 its reverse (131232110201), we get a palindrome (102142464241201).
The spelling of 102011232131000 in words is "one hundred two trillion, eleven billion, two hundred thirty-two million, one hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •