Base | Representation |
---|---|
bin | 1011111010110101110110… |
… | …0100010110011110010101 |
3 | 1201101212121212122110000011 |
4 | 2332231131210112132111 |
5 | 3204210043321433141 |
6 | 43512331313520221 |
7 | 2521561610511652 |
oct | 276553544263625 |
9 | 51355555573004 |
10 | 13105515030421 |
11 | 41a3021635880 |
12 | 1577b2a573071 |
13 | 740ac9c41c68 |
14 | 33444b6d2c29 |
15 | 17ad87b5e881 |
hex | beb5d916795 |
13105515030421 has 8 divisors (see below), whose sum is σ = 14297032512000. Its totient is φ = 11914015386240.
The previous prime is 13105515030407. The next prime is 13105515030457. The reversal of 13105515030421 is 12403051550131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13105515030421 - 223 = 13105506641813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13105515030401) 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, 2899381 + ... + 5883658.
It is an arithmetic number, because the mean of its divisors is an integer number (1787129064000).
Almost surely, 213105515030421 is an apocalyptic number.
13105515030421 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13105515030421 is a deficient number, since it is larger than the sum of its proper divisors (1191517481579).
13105515030421 is a wasteful number, since it uses less digits than its factorization.
13105515030421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8918699.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 13105515030421 its reverse (12403051550131), we get a palindrome (25508566580552).
The spelling of 13105515030421 in words is "thirteen trillion, one hundred five billion, five hundred fifteen million, thirty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •