Base | Representation |
---|---|
bin | 10001100111011001111… |
… | …100100110111101000101 |
3 | 11021201121210000012021002 |
4 | 101213121330212331011 |
5 | 124313142320313440 |
6 | 2324040535503045 |
7 | 153313240143500 |
oct | 21473174467505 |
9 | 4251553005232 |
10 | 1210542354245 |
11 | 42742a666954 |
12 | 176740227a85 |
13 | 8a1cc769543 |
14 | 4283a70a137 |
15 | 217504cb115 |
hex | 119d9f26f45 |
1210542354245 has 24 divisors (see below), whose sum is σ = 1707239147544. Its totient is φ = 821528580096.
The previous prime is 1210542354169. The next prime is 1210542354257. The reversal of 1210542354245 is 5424532450121.
It can be written as a sum of positive squares in 4 ways, for example, as 61131079009 + 1149411275236 = 247247^2 + 1072106^2 .
It is not a de Polignac number, because 1210542354245 - 28 = 1210542353989 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1210542354199 and 1210542354208.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25445252 + ... + 25492781.
It is an arithmetic number, because the mean of its divisors is an integer number (71134964481).
Almost surely, 21210542354245 is an apocalyptic number.
It is an amenable number.
1210542354245 is a deficient number, since it is larger than the sum of its proper divisors (496696793299).
1210542354245 is an equidigital number, since it uses as much as digits as its factorization.
1210542354245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50938149 (or 50938142 counting only the distinct ones).
The product of its (nonzero) digits is 192000, while the sum is 38.
The spelling of 1210542354245 in words is "one trillion, two hundred ten billion, five hundred forty-two million, three hundred fifty-four thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •