Base | Representation |
---|---|
bin | 1011000001000101101000… |
… | …1101110111111110100011 |
3 | 1120220000121012012201100120 |
4 | 2300101122031313332203 |
5 | 3041431040232030230 |
6 | 41432441044051323 |
7 | 2360105252464056 |
oct | 260213215677643 |
9 | 46800535181316 |
10 | 12113321361315 |
11 | 395025a129919 |
12 | 1437786993b43 |
13 | 69b38703aa35 |
14 | 2dc405d3ca9d |
15 | 1601668da310 |
hex | b045a377fa3 |
12113321361315 has 8 divisors (see below), whose sum is σ = 19381314178128. Its totient is φ = 6460438059360.
The previous prime is 12113321361301. The next prime is 12113321361329. The reversal of 12113321361315 is 51316312331121.
It is an interprime number because it is at equal distance from previous prime (12113321361301) and next prime (12113321361329).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12113321361315 - 214 = 12113321344931 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 403777378696 + ... + 403777378725.
It is an arithmetic number, because the mean of its divisors is an integer number (2422664272266).
Almost surely, 212113321361315 is an apocalyptic number.
12113321361315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12113321361315 is a deficient number, since it is larger than the sum of its proper divisors (7267992816813).
12113321361315 is an equidigital number, since it uses as much as digits as its factorization.
12113321361315 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 807554757429.
The product of its digits is 9720, while the sum is 33.
Adding to 12113321361315 its reverse (51316312331121), we get a palindrome (63429633692436).
The spelling of 12113321361315 in words is "twelve trillion, one hundred thirteen billion, three hundred twenty-one million, three hundred sixty-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •