Base | Representation |
---|---|
bin | 11101110011110001100010… |
… | …001111110100000001001100 |
3 | 122012012011012010122100102200 |
4 | 131303301202033310001030 |
5 | 114140430304343234000 |
6 | 1142455023523521500 |
7 | 36420515460553605 |
oct | 3563614217640114 |
9 | 565164163570380 |
10 | 131101230055500 |
11 | 388557a0623111 |
12 | 12854368829290 |
13 | 581ca40148c43 |
14 | 2453494b7adac |
15 | 102539d020500 |
hex | 773c623f404c |
131101230055500 has 72 divisors (see below), whose sum is σ = 413580680429280. Its totient is φ = 34960328013600.
The previous prime is 131101230055441. The next prime is 131101230055541. The reversal of 131101230055500 is 5550032101131.
131101230055500 is a `hidden beast` number, since 1 + 3 + 1 + 101 + 2 + 3 + 0 + 0 + 5 + 550 + 0 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14566798840 + ... + 14566807839.
Almost surely, 2131101230055500 is an apocalyptic number.
131101230055500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131101230055500 is an abundant number, since it is smaller than the sum of its proper divisors (282479450373780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131101230055500 is a wasteful number, since it uses less digits than its factorization.
131101230055500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29133606704 (or 29133606689 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
Adding to 131101230055500 its reverse (5550032101131), we get a palindrome (136651262156631).
The spelling of 131101230055500 in words is "one hundred thirty-one trillion, one hundred one billion, two hundred thirty million, fifty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •