Base | Representation |
---|---|
bin | 10010000011011100110… |
… | …000001110100010111101 |
3 | 11101121100022210000121122 |
4 | 102003130300032202331 |
5 | 130311324434230021 |
6 | 2345540525240325 |
7 | 155430365540213 |
oct | 22033460164275 |
9 | 4347308700548 |
10 | 1240654211261 |
11 | 439181a5a7a3 |
12 | 1805447030a5 |
13 | 8ccbb06700a |
14 | 44095950cb3 |
15 | 22413d4cbab |
hex | 120dcc0e8bd |
1240654211261 has 8 divisors (see below), whose sum is σ = 1268086739040. Its totient is φ = 1213435166608.
The previous prime is 1240654211233. The next prime is 1240654211309. The reversal of 1240654211261 is 1621124560421.
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-1240654211261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1240654241261) 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 7 ways as a sum of consecutive naturals, for example, 53359031 + ... + 53382276.
It is an arithmetic number, because the mean of its divisors is an integer number (158510842380).
Almost surely, 21240654211261 is an apocalyptic number.
It is an amenable number.
1240654211261 is a deficient number, since it is larger than the sum of its proper divisors (27432527779).
1240654211261 is a wasteful number, since it uses less digits than its factorization.
1240654211261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106741563.
The product of its (nonzero) digits is 23040, while the sum is 35.
Adding to 1240654211261 its reverse (1621124560421), we get a palindrome (2861778771682).
The spelling of 1240654211261 in words is "one trillion, two hundred forty billion, six hundred fifty-four million, two hundred eleven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •