Base | Representation |
---|---|
bin | 1011111011100101011111… |
… | …0111110101110011000011 |
3 | 1201110002122012001121202000 |
4 | 2332321113313311303003 |
5 | 3204412241410044201 |
6 | 43522244341555043 |
7 | 2522523545254515 |
oct | 276712767656303 |
9 | 51402565047660 |
10 | 13118304378051 |
11 | 41a8494911a64 |
12 | 157a4b9715a83 |
13 | 742087799b92 |
14 | 334d020a5bb5 |
15 | 17b385850d86 |
hex | bee57df5cc3 |
13118304378051 has 48 divisors (see below), whose sum is σ = 20512408759200. Its totient is φ = 8284768734528.
The previous prime is 13118304378031. The next prime is 13118304378061. The reversal of 13118304378051 is 15087340381131.
13118304378051 is a `hidden beast` number, since 1 + 3 + 11 + 83 + 0 + 437 + 80 + 51 = 666.
It is not a de Polignac number, because 13118304378051 - 215 = 13118304345283 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13118304377988 and 13118304378006.
It is not an unprimeable number, because it can be changed into a prime (13118304378031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 257655985 + ... + 257706893.
It is an arithmetic number, because the mean of its divisors is an integer number (427341849150).
Almost surely, 213118304378051 is an apocalyptic number.
13118304378051 is a deficient number, since it is larger than the sum of its proper divisors (7394104381149).
13118304378051 is a wasteful number, since it uses less digits than its factorization.
13118304378051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77393 (or 77368 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 45.
The spelling of 13118304378051 in words is "thirteen trillion, one hundred eighteen billion, three hundred four million, three hundred seventy-eight thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •