Base | Representation |
---|---|
bin | 1010101100001100001001… |
… | …1100000101011110111001 |
3 | 1112121200212212101011222222 |
4 | 2223003002130011132321 |
5 | 3020040242410223444 |
6 | 40555503021053425 |
7 | 2322135221063612 |
oct | 253030234053671 |
9 | 45550785334888 |
10 | 11754292664249 |
11 | 3821a70858863 |
12 | 139a0889b7275 |
13 | 67356aa82215 |
14 | 2c8ca7344c09 |
15 | 155b51ddbeee |
hex | ab0c27057b9 |
11754292664249 has 4 divisors (see below), whose sum is σ = 11755281512064. Its totient is φ = 11753303816436.
The previous prime is 11754292664243. The next prime is 11754292664293. The reversal of 11754292664249 is 94246629245711.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11754292664249 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11754292664191 and 11754292664200.
It is not an unprimeable number, because it can be changed into a prime (11754292664243) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 494406077 + ... + 494429850.
It is an arithmetic number, because the mean of its divisors is an integer number (2938820378016).
Almost surely, 211754292664249 is an apocalyptic number.
It is an amenable number.
11754292664249 is a deficient number, since it is larger than the sum of its proper divisors (988847815).
11754292664249 is an equidigital number, since it uses as much as digits as its factorization.
11754292664249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 988847814.
The product of its digits is 52254720, while the sum is 62.
The spelling of 11754292664249 in words is "eleven trillion, seven hundred fifty-four billion, two hundred ninety-two million, six hundred sixty-four thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •