Base | Representation |
---|---|
bin | 1011111010110000010100… |
… | …0011100001111000110101 |
3 | 1201101201210101100200022220 |
4 | 2332230011003201320311 |
5 | 3204144023142001123 |
6 | 43511524105112553 |
7 | 2521510036312536 |
oct | 276540503417065 |
9 | 51351711320286 |
10 | 13104030031413 |
11 | 41a242a371072 |
12 | 1577795188759 |
13 | 7409213a2919 |
14 | 33434a3b668d |
15 | 17acec5c9ce3 |
hex | beb050e1e35 |
13104030031413 has 8 divisors (see below), whose sum is σ = 18391621096800. Its totient is φ = 8276229493488.
The previous prime is 13104030031369. The next prime is 13104030031453. The reversal of 13104030031413 is 31413003040131.
13104030031413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13104030031413 - 236 = 13035310554677 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13104030031453) 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, 114947631798 + ... + 114947631911.
It is an arithmetic number, because the mean of its divisors is an integer number (2298952637100).
Almost surely, 213104030031413 is an apocalyptic number.
It is an amenable number.
13104030031413 is a deficient number, since it is larger than the sum of its proper divisors (5287591065387).
13104030031413 is a wasteful number, since it uses less digits than its factorization.
13104030031413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229895263731.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 13104030031413 its reverse (31413003040131), we get a palindrome (44517033071544).
The spelling of 13104030031413 in words is "thirteen trillion, one hundred four billion, thirty million, thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •