Base | Representation |
---|---|
bin | 1011111011110100110010… |
… | …1011010001010111110000 |
3 | 1201110111020102100002022021 |
4 | 2332331030223101113300 |
5 | 3204444144321013130 |
6 | 43524204055521224 |
7 | 2523030406241152 |
oct | 276751453212760 |
9 | 51414212302267 |
10 | 13122411501040 |
11 | 41aa202212286 |
12 | 157b265089214 |
13 | 74259065727a |
14 | 3351b1742ad2 |
15 | 17b5261d637a |
hex | bef4cad15f0 |
13122411501040 has 40 divisors (see below), whose sum is σ = 31836111385248. Its totient is φ = 5020748747520.
The previous prime is 13122411500999. The next prime is 13122411501071. The reversal of 13122411501040 is 4010511422131.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 13122411500996 and 13122411501014.
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, 3565870851 + ... + 3565874530.
Almost surely, 213122411501040 is an apocalyptic number.
13122411501040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13122411501040 is an abundant number, since it is smaller than the sum of its proper divisors (18713699884208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13122411501040 is a wasteful number, since it uses less digits than its factorization.
13122411501040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7131745417 (or 7131745411 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 13122411501040 its reverse (4010511422131), we get a palindrome (17132922923171).
The spelling of 13122411501040 in words is "thirteen trillion, one hundred twenty-two billion, four hundred eleven million, five hundred one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •