Base | Representation |
---|---|
bin | 1011111100100001000111… |
… | …1001111111000000101101 |
3 | 1201111121221200012222210010 |
4 | 2333020101321333000231 |
5 | 3210143031430413031 |
6 | 43533452514403433 |
7 | 2523631312243563 |
oct | 277102171770055 |
9 | 51447850188703 |
10 | 13134310404141 |
11 | 42042588a32a3 |
12 | 1581625b90579 |
13 | 743738882c34 |
14 | 3359bdb65a33 |
15 | 17b9c0b37246 |
hex | bf211e7f02d |
13134310404141 has 8 divisors (see below), whose sum is σ = 17517337252704. Its totient is φ = 8753745245840.
The previous prime is 13134310404079. The next prime is 13134310404199. The reversal of 13134310404141 is 14140401343131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13134310404141 - 215 = 13134310371373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13134310404099 and 13134310404108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13134310504141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 615410115 + ... + 615431456.
It is an arithmetic number, because the mean of its divisors is an integer number (2189667156588).
Almost surely, 213134310404141 is an apocalyptic number.
It is an amenable number.
13134310404141 is a deficient number, since it is larger than the sum of its proper divisors (4383026848563).
13134310404141 is a wasteful number, since it uses less digits than its factorization.
13134310404141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1230845131.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 13134310404141 its reverse (14140401343131), we get a palindrome (27274711747272).
The spelling of 13134310404141 in words is "thirteen trillion, one hundred thirty-four billion, three hundred ten million, four hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •