Base | Representation |
---|---|
bin | 1011111100110111000111… |
… | …0000100000100001110110 |
3 | 1201112012012001221022222220 |
4 | 2333031301300200201312 |
5 | 3210242124124000042 |
6 | 43540310350303210 |
7 | 2524230511602630 |
oct | 277156160404166 |
9 | 51465161838886 |
10 | 13140213500022 |
11 | 4206807a57634 |
12 | 15827b2ab7b06 |
13 | 74416985038b |
14 | 335dbdb4ba50 |
15 | 17bc18ecc8ec |
hex | bf371c20876 |
13140213500022 has 64 divisors (see below), whose sum is σ = 30898544269824. Its totient is φ = 3646717632000.
The previous prime is 13140213499997. The next prime is 13140213500023. The reversal of 13140213500022 is 22000531204131.
13140213500022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13140213499965 and 13140213500001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13140213500023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6208104 + ... + 8051147.
It is an arithmetic number, because the mean of its divisors is an integer number (482789754216).
Almost surely, 213140213500022 is an apocalyptic number.
13140213500022 is an abundant number, since it is smaller than the sum of its proper divisors (17758330769802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13140213500022 is a wasteful number, since it uses less digits than its factorization.
13140213500022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14259893.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 13140213500022 its reverse (22000531204131), we get a palindrome (35140744704153).
The spelling of 13140213500022 in words is "thirteen trillion, one hundred forty billion, two hundred thirteen million, five hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •