Base | Representation |
---|---|
bin | 1011111101000101010001… |
… | …0111010001011010100110 |
3 | 1201112120000000201102100022 |
4 | 2333101110113101122212 |
5 | 3210322420410000200 |
6 | 43542135520315142 |
7 | 2524423644511313 |
oct | 277212427213246 |
9 | 51476000642308 |
10 | 13144015312550 |
11 | 4208388a86661 |
12 | 1583494172ab2 |
13 | 7446243a07a5 |
14 | 336260a31d0a |
15 | 17bd8cb55885 |
hex | bf4545d16a6 |
13144015312550 has 24 divisors (see below), whose sum is σ = 24521729142072. Its totient is φ = 5241722112000.
The previous prime is 13144015312531. The next prime is 13144015312607. The reversal of 13144015312550 is 5521351044131.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 13144015312550.
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 11 ways as a sum of consecutive naturals, for example, 397083611 + ... + 397116710.
It is an arithmetic number, because the mean of its divisors is an integer number (1021738714253).
Almost surely, 213144015312550 is an apocalyptic number.
13144015312550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13144015312550 is a deficient number, since it is larger than the sum of its proper divisors (11377713829522).
13144015312550 is a wasteful number, since it uses less digits than its factorization.
13144015312550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 794200664 (or 794200659 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 13144015312550 its reverse (5521351044131), we get a palindrome (18665366356681).
The spelling of 13144015312550 in words is "thirteen trillion, one hundred forty-four billion, fifteen million, three hundred twelve thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •