Base | Representation |
---|---|
bin | 1100100111101000110100… |
… | …0010010111000111111100 |
3 | 1211010110002022102200201011 |
4 | 3021322031002113013330 |
5 | 3304312211301310130 |
6 | 45302045433125004 |
7 | 2631305113625440 |
oct | 311721502270774 |
9 | 54113068380634 |
10 | 13875110572540 |
11 | 446a446216328 |
12 | 168110a559764 |
13 | 798556ab3b49 |
14 | 35d7b7a08820 |
15 | 190dcba8352a |
hex | c9e8d0971fc |
13875110572540 has 48 divisors (see below), whose sum is σ = 33307558405632. Its totient is φ = 4756138906176.
The previous prime is 13875110572523. The next prime is 13875110572571. The reversal of 13875110572540 is 4527501157831.
It is a super-2 number, since 2×138751105725402 (a number of 27 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 10211062 + ... + 11489821.
It is an arithmetic number, because the mean of its divisors is an integer number (693907466784).
Almost surely, 213875110572540 is an apocalyptic number.
13875110572540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13875110572540 is an abundant number, since it is smaller than the sum of its proper divisors (19432447833092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13875110572540 is a wasteful number, since it uses less digits than its factorization.
13875110572540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21705466 (or 21705464 counting only the distinct ones).
The product of its (nonzero) digits is 1176000, while the sum is 49.
The spelling of 13875110572540 in words is "thirteen trillion, eight hundred seventy-five billion, one hundred ten million, five hundred seventy-two thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •