Base | Representation |
---|---|
bin | 10110010000111110… |
… | …01001100111011011 |
3 | 1010212001200221012122 |
4 | 23020133021213123 |
5 | 143440101344033 |
6 | 5254045531455 |
7 | 602135305316 |
oct | 131037114733 |
9 | 33761627178 |
10 | 11953543643 |
11 | 5084511298 |
12 | 2397273b8b |
13 | 118664a362 |
14 | 8157a797d |
15 | 49e645a98 |
hex | 2c87c99db |
11953543643 has 2 divisors, whose sum is σ = 11953543644. Its totient is φ = 11953543642.
The previous prime is 11953543619. The next prime is 11953543687. The reversal of 11953543643 is 34634535911.
It is an a-pointer prime, because the next prime (11953543687) can be obtained adding 11953543643 to its sum of digits (44).
It is a weak prime.
It is an emirp because it is prime and its reverse (34634535911) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11953543643 - 26 = 11953543579 is a prime.
It is a super-2 number, since 2×119535436432 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11953543594 and 11953543603.
It is not a weakly prime, because it can be changed into another prime (11953543243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5976771821 + 5976771822.
It is an arithmetic number, because the mean of its divisors is an integer number (5976771822).
Almost surely, 211953543643 is an apocalyptic number.
11953543643 is a deficient number, since it is larger than the sum of its proper divisors (1).
11953543643 is an equidigital number, since it uses as much as digits as its factorization.
11953543643 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 583200, while the sum is 44.
The spelling of 11953543643 in words is "eleven billion, nine hundred fifty-three million, five hundred forty-three thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •