Base | Representation |
---|---|
bin | 1100010110001011011… |
… | …11000011011011100101 |
3 | 1111112222220202100001001 |
4 | 12023011233003123211 |
5 | 23422302401211011 |
6 | 522515205433301 |
7 | 42435446361313 |
oct | 6130557033345 |
9 | 1445886670031 |
10 | 424224241381 |
11 | 153a045854a6 |
12 | 6a273a0b831 |
13 | 3100922b795 |
14 | 167654d10b3 |
15 | b07d4317c1 |
hex | 62c5bc36e5 |
424224241381 has 2 divisors, whose sum is σ = 424224241382. Its totient is φ = 424224241380.
The previous prime is 424224241373. The next prime is 424224241403. The reversal of 424224241381 is 183142422424.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 349440588225 + 74783653156 = 591135^2 + 273466^2 .
It is a cyclic number.
It is not a de Polignac number, because 424224241381 - 23 = 424224241373 is a prime.
It is a super-3 number, since 3×4242242413813 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 424224241381.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (424224241351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212112120690 + 212112120691.
It is an arithmetic number, because the mean of its divisors is an integer number (212112120691).
Almost surely, 2424224241381 is an apocalyptic number.
It is an amenable number.
424224241381 is a deficient number, since it is larger than the sum of its proper divisors (1).
424224241381 is an equidigital number, since it uses as much as digits as its factorization.
424224241381 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 98304, while the sum is 37.
The spelling of 424224241381 in words is "four hundred twenty-four billion, two hundred twenty-four million, two hundred forty-one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •