Base | Representation |
---|---|
bin | 1010100001001101011100… |
… | …10110111010011100011100 |
3 | 10000220022222202020212010021 |
4 | 11100212232112322130130 |
5 | 11012440422434143400 |
6 | 121110214505321524 |
7 | 4605116526666613 |
oct | 520465626723434 |
9 | 100808882225107 |
10 | 23131324131100 |
11 | 7408a37492169 |
12 | 27170097962a4 |
13 | cba375121c93 |
14 | 59d7c242287a |
15 | 2a1a737e871a |
hex | 1509ae5ba71c |
23131324131100 has 18 divisors (see below), whose sum is σ = 50194973364704. Its totient is φ = 9252529652400.
The previous prime is 23131324131079. The next prime is 23131324131133. The reversal of 23131324131100 is 113142313132.
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 pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 115656620556 + ... + 115656620755.
Almost surely, 223131324131100 is an apocalyptic number.
23131324131100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23131324131100 is an abundant number, since it is smaller than the sum of its proper divisors (27063649233604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23131324131100 is a wasteful number, since it uses less digits than its factorization.
23131324131100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231313241325 (or 231313241318 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 23131324131100 its reverse (113142313132), we get a palindrome (23244466444232).
The spelling of 23131324131100 in words is "twenty-three trillion, one hundred thirty-one billion, three hundred twenty-four million, one hundred thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •