Base | Representation |
---|---|
bin | 1011111100010110010001… |
… | …1100100100010001110100 |
3 | 1201111100102212020000222112 |
4 | 2333011210130210101310 |
5 | 3210121101424442400 |
6 | 43532252035350152 |
7 | 2523466224225041 |
oct | 277054434442164 |
9 | 51440385200875 |
10 | 13131400234100 |
11 | 4202aa5108495 |
12 | 1580b53452358 |
13 | 743393991125 |
14 | 3357c54641c8 |
15 | 17b8a03d9835 |
hex | bf164724474 |
13131400234100 has 36 divisors (see below), whose sum is σ = 28499032343628. Its totient is φ = 5251842336000.
The previous prime is 13131400234093. The next prime is 13131400234111. The reversal of 13131400234100 is 143200413131.
It can be written as a sum of positive squares in 6 ways, for example, as 758411073424 + 12372989160676 = 870868^2 + 3517526^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8236211 + ... + 9700410.
It is an arithmetic number, because the mean of its divisors is an integer number (791639787323).
Almost surely, 213131400234100 is an apocalyptic number.
13131400234100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13131400234100 is an abundant number, since it is smaller than the sum of its proper divisors (15367632109528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13131400234100 is a wasteful number, since it uses less digits than its factorization.
13131400234100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17943956 (or 17943949 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13131400234100 its reverse (143200413131), we get a palindrome (13274600647231).
The spelling of 13131400234100 in words is "thirteen trillion, one hundred thirty-one billion, four hundred million, two hundred thirty-four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •