Base | Representation |
---|---|
bin | 1011111010100110100001… |
… | …0100010111000001010000 |
3 | 1201101111000010021121012121 |
4 | 2332221220110113001100 |
5 | 3204123132001423212 |
6 | 43510411131304024 |
7 | 2521354626063322 |
oct | 276515024270120 |
9 | 51344003247177 |
10 | 13101400420432 |
11 | 41a12aaa91455 |
12 | 15771805ab014 |
13 | 7405c2662aac |
14 | 33417b067612 |
15 | 17abe67ead07 |
hex | bea68517050 |
13101400420432 has 20 divisors (see below), whose sum is σ = 25410599192340. Its totient is φ = 6543826435328.
The previous prime is 13101400420369. The next prime is 13101400420441. The reversal of 13101400420432 is 23402400410131.
It can be written as a sum of positive squares in 2 ways, for example, as 4833912315456 + 8267488104976 = 2198616^2 + 2875324^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13101400420397 and 13101400420406.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 429595207 + ... + 429625702.
It is an arithmetic number, because the mean of its divisors is an integer number (1270529959617).
Almost surely, 213101400420432 is an apocalyptic number.
It is an amenable number.
13101400420432 is a deficient number, since it is larger than the sum of its proper divisors (12309198771908).
13101400420432 is an equidigital number, since it uses as much as digits as its factorization.
13101400420432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 859221870 (or 859221864 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 13101400420432 its reverse (23402400410131), we get a palindrome (36503800830563).
The spelling of 13101400420432 in words is "thirteen trillion, one hundred one billion, four hundred million, four hundred twenty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •