Base | Representation |
---|---|
bin | 110110111001001100010010… |
… | …001111000010011110101101 |
3 | 1011122210222101022200101222222 |
4 | 312321030102033002132231 |
5 | 223121000302411421121 |
6 | 2213244552025245125 |
7 | 101565234303623252 |
oct | 6671142217023655 |
9 | 1148728338611888 |
10 | 241424712607661 |
11 | 6aa1a711379600 |
12 | 230b18879337a5 |
13 | a49333929167b |
14 | 4389038841429 |
15 | 1cda0267700ab |
hex | db93123c27ad |
241424712607661 has 12 divisors (see below), whose sum is σ = 265678758675036. Its totient is φ = 219219711237120.
The previous prime is 241424712607513. The next prime is 241424712607667. The reversal of 241424712607661 is 166706217424142.
It can be written as a sum of positive squares in 2 ways, for example, as 103033157775625 + 138391554832036 = 10150525^2 + 11763994^2 .
It is not a de Polignac number, because 241424712607661 - 218 = 241424712345517 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 (241424712607667) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1169442836 + ... + 1169649261.
It is an arithmetic number, because the mean of its divisors is an integer number (22139896556253).
Almost surely, 2241424712607661 is an apocalyptic number.
It is an amenable number.
241424712607661 is a deficient number, since it is larger than the sum of its proper divisors (24254046067375).
241424712607661 is a wasteful number, since it uses less digits than its factorization.
241424712607661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2339092972 (or 2339092961 counting only the distinct ones).
The product of its (nonzero) digits is 5419008, while the sum is 53.
The spelling of 241424712607661 in words is "two hundred forty-one trillion, four hundred twenty-four billion, seven hundred twelve million, six hundred seven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •