Base | Representation |
---|---|
bin | 1011010010011010101110… |
… | …1100100011001001111101 |
3 | 1121221111001210102111012012 |
4 | 2310212223230203021331 |
5 | 3111320303010203123 |
6 | 42221315323221005 |
7 | 2420445111506444 |
oct | 264465354431175 |
9 | 47844053374165 |
10 | 12411041100413 |
11 | 3a5554716737a |
12 | 1485414677765 |
13 | 6c0482615c27 |
14 | 30c9aa2add5b |
15 | 167c8dcc6378 |
hex | b49abb2327d |
12411041100413 has 8 divisors (see below), whose sum is σ = 12839329198080. Its totient is φ = 11982774413680.
The previous prime is 12411041100371. The next prime is 12411041100473. The reversal of 12411041100413 is 31400114011421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12411041100413 - 212 = 12411041096317 is a prime.
It is a super-2 number, since 2×124110411004132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12411041100473) 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, 4168973 + ... + 6496338.
It is an arithmetic number, because the mean of its divisors is an integer number (1604916149760).
Almost surely, 212411041100413 is an apocalyptic number.
It is an amenable number.
12411041100413 is a deficient number, since it is larger than the sum of its proper divisors (428288097667).
12411041100413 is a wasteful number, since it uses less digits than its factorization.
12411041100413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10705467.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 12411041100413 its reverse (31400114011421), we get a palindrome (43811155111834).
The spelling of 12411041100413 in words is "twelve trillion, four hundred eleven billion, forty-one million, one hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •