Base | Representation |
---|---|
bin | 10001111001100010111… |
… | …010110110011101011001 |
3 | 11100120220020002101010011 |
4 | 101321202322312131121 |
5 | 130123040140204431 |
6 | 2341021414321521 |
7 | 154603022354161 |
oct | 21714272663531 |
9 | 4316806071104 |
10 | 1230020241241 |
11 | 4347153a5720 |
12 | 17a4773592a1 |
13 | 8bcb4c18c6c |
14 | 437675215a1 |
15 | 21ee04b1cb1 |
hex | 11e62eb6759 |
1230020241241 has 32 divisors (see below), whose sum is σ = 1377749606400. Its totient is φ = 1088692248000.
The previous prime is 1230020241199. The next prime is 1230020241253. The reversal of 1230020241241 is 1421420200321.
It is a cyclic number.
It is not a de Polignac number, because 1230020241241 - 229 = 1229483370329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1230020247241) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 28364946 + ... + 28408276.
It is an arithmetic number, because the mean of its divisors is an integer number (43054675200).
Almost surely, 21230020241241 is an apocalyptic number.
1230020241241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1230020241241 is a deficient number, since it is larger than the sum of its proper divisors (147729365159).
1230020241241 is a wasteful number, since it uses less digits than its factorization.
1230020241241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43821.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 1230020241241 its reverse (1421420200321), we get a palindrome (2651440441562).
The spelling of 1230020241241 in words is "one trillion, two hundred thirty billion, twenty million, two hundred forty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •