Base | Representation |
---|---|
bin | 10110010000110110… |
… | …00000100000110101 |
3 | 1010211222122202200112 |
4 | 23020123000200311 |
5 | 143434312122111 |
6 | 5254010352405 |
7 | 602123133455 |
oct | 131033004065 |
9 | 33758582615 |
10 | 11952457781 |
11 | 508393a490 |
12 | 2396a2b705 |
13 | 118635a034 |
14 | 8155a3d65 |
15 | 49e4cde8b |
hex | 2c86c0835 |
11952457781 has 8 divisors (see below), whose sum is σ = 13066272000. Its totient is φ = 10843181440.
The previous prime is 11952457757. The next prime is 11952457787. The reversal of 11952457781 is 18775425911.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11952457781 is a prime.
It is a super-2 number, since 2×119524577812 (a number of 21 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 (11952457787) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1128956 + ... + 1139493.
It is an arithmetic number, because the mean of its divisors is an integer number (1633284000).
Almost surely, 211952457781 is an apocalyptic number.
11952457781 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11952457781 is a deficient number, since it is larger than the sum of its proper divisors (1113814219).
11952457781 is a wasteful number, since it uses less digits than its factorization.
11952457781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2268939.
The product of its digits is 705600, while the sum is 50.
The spelling of 11952457781 in words is "eleven billion, nine hundred fifty-two million, four hundred fifty-seven thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •