Base | Representation |
---|---|
bin | 10110010001111000… |
… | …00001101101111111 |
3 | 1010212120221112001122 |
4 | 23020330001231333 |
5 | 143444021112341 |
6 | 5254520101155 |
7 | 602256533636 |
oct | 131074015577 |
9 | 33776845048 |
10 | 11961113471 |
11 | 508881164a |
12 | 23999047bb |
13 | 118809aa48 |
14 | 8167b851d |
15 | 4a013d94b |
hex | 2c8f01b7f |
11961113471 has 4 divisors (see below), whose sum is σ = 11982359352. Its totient is φ = 11939867592.
The previous prime is 11961113401. The next prime is 11961113513. The reversal of 11961113471 is 17431116911.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 17431116911 = 13 ⋅1340855147.
It is a cyclic number.
It is not a de Polignac number, because 11961113471 - 218 = 11960851327 is a prime.
It is a super-3 number, since 3×119611134713 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11961113401) 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 in 3 ways as a sum of consecutive naturals, for example, 10622096 + ... + 10623221.
It is an arithmetic number, because the mean of its divisors is an integer number (2995589838).
Almost surely, 211961113471 is an apocalyptic number.
11961113471 is a deficient number, since it is larger than the sum of its proper divisors (21245881).
11961113471 is an equidigital number, since it uses as much as digits as its factorization.
11961113471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21245880.
The product of its digits is 4536, while the sum is 35.
The spelling of 11961113471 in words is "eleven billion, nine hundred sixty-one million, one hundred thirteen thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •