Base | Representation |
---|---|
bin | 1011011110010011001110… |
… | …0011011101001101111001 |
3 | 1122122222222212002020101122 |
4 | 2313210303203131031321 |
5 | 3123141344033143311 |
6 | 42455200243355025 |
7 | 2441263005511265 |
oct | 267446343351571 |
9 | 48588885066348 |
10 | 12615183881081 |
11 | 4024084472a51 |
12 | 14b8aa7682a75 |
13 | 7067b6cc86c2 |
14 | 3188146710a5 |
15 | 16d23acc60db |
hex | b79338dd379 |
12615183881081 has 16 divisors (see below), whose sum is σ = 12921667351824. Its totient is φ = 12312349691904.
The previous prime is 12615183881051. The next prime is 12615183881117. The reversal of 12615183881081 is 18018838151621.
It can be written as a sum of positive squares in 8 ways, for example, as 557622121081 + 12057561760000 = 746741^2 + 3472400^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12615183881081 is a prime.
It is a super-2 number, since 2×126151838810812 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12615183881051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51122111 + ... + 51368283.
It is an arithmetic number, because the mean of its divisors is an integer number (807604209489).
Almost surely, 212615183881081 is an apocalyptic number.
It is an amenable number.
12615183881081 is a deficient number, since it is larger than the sum of its proper divisors (306483470743).
12615183881081 is an equidigital number, since it uses as much as digits as its factorization.
12615183881081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 253580.
The product of its (nonzero) digits is 737280, while the sum is 53.
The spelling of 12615183881081 in words is "twelve trillion, six hundred fifteen billion, one hundred eighty-three million, eight hundred eighty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •