Base | Representation |
---|---|
bin | 1011111101001001001001… |
… | …0001100110111010011100 |
3 | 1201112122200102012222102022 |
4 | 2333102102101212322130 |
5 | 3210332032311441012 |
6 | 43542430543315312 |
7 | 2524461456364604 |
oct | 277222221467234 |
9 | 51478612188368 |
10 | 13145054015132 |
11 | 4208871334246 |
12 | 1583723babb38 |
13 | 74475b63bac0 |
14 | 33631c975c04 |
15 | 17bdede2e472 |
hex | bf492466e9c |
13145054015132 has 48 divisors (see below), whose sum is σ = 25118181638592. Its totient is φ = 5982540664320.
The previous prime is 13145054015129. The next prime is 13145054015141. The reversal of 13145054015132 is 23151045054131.
It is a happy number.
It is a super-3 number, since 3×131450540151323 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13145054015092 and 13145054015101.
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, 17228657 + ... + 17975447.
It is an arithmetic number, because the mean of its divisors is an integer number (523295450804).
Almost surely, 213145054015132 is an apocalyptic number.
It is an amenable number.
13145054015132 is a deficient number, since it is larger than the sum of its proper divisors (11973127623460).
13145054015132 is a wasteful number, since it uses less digits than its factorization.
13145054015132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 751518 (or 751516 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 13145054015132 its reverse (23151045054131), we get a palindrome (36296099069263).
The spelling of 13145054015132 in words is "thirteen trillion, one hundred forty-five billion, fifty-four million, fifteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •