Base | Representation |
---|---|
bin | 10110010011100100… |
… | …01100100111011001 |
3 | 1010220120122222100202 |
4 | 23021302030213121 |
5 | 144011140021011 |
6 | 5300144311545 |
7 | 602521326356 |
oct | 131162144731 |
9 | 33816588322 |
10 | 11975313881 |
11 | 5095830623 |
12 | 23a26125b5 |
13 | 118b00045b |
14 | 81863362d |
15 | 4a14e623b |
hex | 2c9c8c9d9 |
11975313881 has 8 divisors (see below), whose sum is σ = 12199897728. Its totient is φ = 11751642000.
The previous prime is 11975313871. The next prime is 11975313887. The reversal of 11975313881 is 18831357911.
11975313881 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11975313881 - 210 = 11975312857 is a prime.
It is a super-2 number, since 2×119753138812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11975313887) 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 7 ways as a sum of consecutive naturals, for example, 201455 + ... + 254036.
It is an arithmetic number, because the mean of its divisors is an integer number (1524987216).
Almost surely, 211975313881 is an apocalyptic number.
It is an amenable number.
11975313881 is a deficient number, since it is larger than the sum of its proper divisors (224583847).
11975313881 is an equidigital number, since it uses as much as digits as its factorization.
11975313881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455983.
The product of its digits is 181440, while the sum is 47.
The spelling of 11975313881 in words is "eleven billion, nine hundred seventy-five million, three hundred thirteen thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •