Base | Representation |
---|---|
bin | 1011001011001101111011… |
… | …0110111100010101100111 |
3 | 1121111122210020011102111001 |
4 | 2302303132312330111213 |
5 | 3102303440411131211 |
6 | 42044421211254131 |
7 | 2405505605503546 |
oct | 262633666742547 |
9 | 47448706142431 |
10 | 12287345411431 |
11 | 3a08041177442 |
12 | 146545314a347 |
13 | 6b18cb88725c |
14 | 3069d41ca15d |
15 | 16494e65bac1 |
hex | b2cdedbc567 |
12287345411431 has 8 divisors (see below), whose sum is σ = 12355418950784. Its totient is φ = 12219273934560.
The previous prime is 12287345411413. The next prime is 12287345411443. The reversal of 12287345411431 is 13411454378221.
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 12287345411431 - 29 = 12287345410919 is a prime.
It is a super-2 number, since 2×122873454114312 (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 (12287345415431) 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, 12314161 + ... + 13274533.
It is an arithmetic number, because the mean of its divisors is an integer number (1544427368848).
Almost surely, 212287345411431 is an apocalyptic number.
12287345411431 is a deficient number, since it is larger than the sum of its proper divisors (68073539353).
12287345411431 is an equidigital number, since it uses as much as digits as its factorization.
12287345411431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1031241.
The product of its digits is 645120, while the sum is 46.
Adding to 12287345411431 its reverse (13411454378221), we get a palindrome (25698799789652).
The spelling of 12287345411431 in words is "twelve trillion, two hundred eighty-seven billion, three hundred forty-five million, four hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •