Base | Representation |
---|---|
bin | 1011111100110111100001… |
… | …0110100101001111111100 |
3 | 1201112012110210010122011121 |
4 | 2333031320112211033330 |
5 | 3210242340440102444 |
6 | 43540325342000324 |
7 | 2524233324216322 |
oct | 277157026451774 |
9 | 51465423118147 |
10 | 13140324144124 |
11 | 4206864459141 |
12 | 1582823b760a4 |
13 | 74418674c968 |
14 | 335dd070dd12 |
15 | 17bc23a86084 |
hex | bf3785a53fc |
13140324144124 has 48 divisors (see below), whose sum is σ = 25139932554240. Its totient is φ = 5982718452480.
The previous prime is 13140324144109. The next prime is 13140324144179. The reversal of 13140324144124 is 42144142304131.
It is a super-2 number, since 2×131403241441242 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a self number, because there is not a number n which added to its sum of digits gives 13140324144124.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7714947 + ... + 9262885.
It is an arithmetic number, because the mean of its divisors is an integer number (523748594880).
Almost surely, 213140324144124 is an apocalyptic number.
It is an amenable number.
13140324144124 is a deficient number, since it is larger than the sum of its proper divisors (11999608410116).
13140324144124 is a wasteful number, since it uses less digits than its factorization.
13140324144124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1552018 (or 1552016 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 34.
Adding to 13140324144124 its reverse (42144142304131), we get a palindrome (55284466448255).
The spelling of 13140324144124 in words is "thirteen trillion, one hundred forty billion, three hundred twenty-four million, one hundred forty-four thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •