Base | Representation |
---|---|
bin | 1011010010100011000000… |
… | …0110011000110110110011 |
3 | 1121221200210121022120120121 |
4 | 2310220300012120312303 |
5 | 3111334330142411413 |
6 | 42222323554551111 |
7 | 2420554134014404 |
oct | 264506006306663 |
9 | 47850717276517 |
10 | 12413262466483 |
11 | 3a5648705a5aa |
12 | 1485934598497 |
13 | 6c07478b8718 |
14 | 30cb3b30d9ab |
15 | 167d6dd13b8d |
hex | b4a30198db3 |
12413262466483 has 4 divisors (see below), whose sum is σ = 12841305999840. Its totient is φ = 11985218933128.
The previous prime is 12413262466471. The next prime is 12413262466489. The reversal of 12413262466483 is 38466426231421.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12413262466483 is a prime.
It is a super-2 number, since 2×124132624664832 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12413262466483.
It is not an unprimeable number, because it can be changed into a prime (12413262466489) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 214021766635 + ... + 214021766692.
It is an arithmetic number, because the mean of its divisors is an integer number (3210326499960).
Almost surely, 212413262466483 is an apocalyptic number.
12413262466483 is a deficient number, since it is larger than the sum of its proper divisors (428043533357).
12413262466483 is an equidigital number, since it uses as much as digits as its factorization.
12413262466483 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 428043533356.
The product of its digits is 7962624, while the sum is 52.
The spelling of 12413262466483 in words is "twelve trillion, four hundred thirteen billion, two hundred sixty-two million, four hundred sixty-six thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •