Base | Representation |
---|---|
bin | 1011001010000000001011… |
… | …1101011000011001000001 |
3 | 1121102122220211010210121022 |
4 | 2302200002331120121001 |
5 | 3101433220404224442 |
6 | 42031050312435225 |
7 | 2404136500500461 |
oct | 262400275303101 |
9 | 47378824123538 |
10 | 12266476242497 |
11 | 39aa202063994 |
12 | 14613aa0a8b15 |
13 | 6ac9540bc299 |
14 | 3059b46d1ba1 |
15 | 16412c4543d2 |
hex | b2802f58641 |
12266476242497 has 4 divisors (see below), whose sum is σ = 12912080255280. Its totient is φ = 11620872229716.
The previous prime is 12266476242479. The next prime is 12266476242541. The reversal of 12266476242497 is 79424267466221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12266476242497 - 214 = 12266476226113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12266476242997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 322802006363 + ... + 322802006400.
It is an arithmetic number, because the mean of its divisors is an integer number (3228020063820).
Almost surely, 212266476242497 is an apocalyptic number.
It is an amenable number.
12266476242497 is a deficient number, since it is larger than the sum of its proper divisors (645604012783).
12266476242497 is an equidigital number, since it uses as much as digits as its factorization.
12266476242497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645604012782.
The product of its digits is 97542144, while the sum is 62.
The spelling of 12266476242497 in words is "twelve trillion, two hundred sixty-six billion, four hundred seventy-six million, two hundred forty-two thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •