Base | Representation |
---|---|
bin | 1011110111110010101000… |
… | …0100000000010101000100 |
3 | 1201012212100202210101201212 |
4 | 2331330222010000111010 |
5 | 3202330232443234130 |
6 | 43432303324110552 |
7 | 2515025160266645 |
oct | 275745204002504 |
9 | 51185322711655 |
10 | 13053111305540 |
11 | 4182880046739 |
12 | 1569944695458 |
13 | 738b981b1027 |
14 | 331ab9a536cc |
15 | 17981c259e95 |
hex | bdf2a100544 |
13053111305540 has 12 divisors (see below), whose sum is σ = 27411533741676. Its totient is φ = 5221244522208.
The previous prime is 13053111305527. The next prime is 13053111305551. The reversal of 13053111305540 is 4550311135031.
It can be written as a sum of positive squares in 2 ways, for example, as 3557358121216 + 9495753184324 = 1886096^2 + 3081518^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13053111305497 and 13053111305506.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 326327782619 + ... + 326327782658.
It is an arithmetic number, because the mean of its divisors is an integer number (2284294478473).
Almost surely, 213053111305540 is an apocalyptic number.
13053111305540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13053111305540 is an abundant number, since it is smaller than the sum of its proper divisors (14358422436136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13053111305540 is a wasteful number, since it uses less digits than its factorization.
13053111305540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 652655565286 (or 652655565284 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 32.
The spelling of 13053111305540 in words is "thirteen trillion, fifty-three billion, one hundred eleven million, three hundred five thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •