Base | Representation |
---|---|
bin | 1011000001100100110110… |
… | …10011111110000111100001 |
3 | 10011211122110022022100020101 |
4 | 11200302123103332013201 |
5 | 11134200441141403043 |
6 | 123321133102542401 |
7 | 5051346036313144 |
oct | 540623323760741 |
9 | 104748408270211 |
10 | 24243401122273 |
11 | 77a7628a003a3 |
12 | 2876649b97a01 |
13 | 106b1b1caa778 |
14 | 5db55b82a05b |
15 | 2c095e67724d |
hex | 160c9b4fe1e1 |
24243401122273 has 2 divisors, whose sum is σ = 24243401122274. Its totient is φ = 24243401122272.
The previous prime is 24243401122271. The next prime is 24243401122333. The reversal of 24243401122273 is 37222110434242.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21061233919504 + 3182167202769 = 4589252^2 + 1783863^2 .
It is a cyclic number.
It is not a de Polignac number, because 24243401122273 - 21 = 24243401122271 is a prime.
Together with 24243401122271, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (24243401122271) 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 as a sum of consecutive naturals, namely, 12121700561136 + 12121700561137.
It is an arithmetic number, because the mean of its divisors is an integer number (12121700561137).
Almost surely, 224243401122273 is an apocalyptic number.
It is an amenable number.
24243401122273 is a deficient number, since it is larger than the sum of its proper divisors (1).
24243401122273 is an equidigital number, since it uses as much as digits as its factorization.
24243401122273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129024, while the sum is 37.
The spelling of 24243401122273 in words is "twenty-four trillion, two hundred forty-three billion, four hundred one million, one hundred twenty-two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •