Base | Representation |
---|---|
bin | 110010111101011000001001… |
… | …111100111100111111110101 |
3 | 1002101112200021121222122220202 |
4 | 302331120021330330333311 |
5 | 213333441032001211201 |
6 | 2112355213054010245 |
7 | 65131101154115642 |
oct | 6275301174747765 |
9 | 1071480247878822 |
10 | 224120150413301 |
11 | 6545890512088a |
12 | 21177ba0aa6985 |
13 | 980959376a74c |
14 | 3d4b68a4bcdc9 |
15 | 1ad9d2d197c6b |
hex | cbd609f3cff5 |
224120150413301 has 2 divisors, whose sum is σ = 224120150413302. Its totient is φ = 224120150413300.
The previous prime is 224120150413283. The next prime is 224120150413309. The reversal of 224120150413301 is 103314051021422.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 220882313652100 + 3237836761201 = 14862110^2 + 1799399^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-224120150413301 is a prime.
It is a super-2 number, since 2×2241201504133012 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (224120150413309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112060075206650 + 112060075206651.
It is an arithmetic number, because the mean of its divisors is an integer number (112060075206651).
Almost surely, 2224120150413301 is an apocalyptic number.
It is an amenable number.
224120150413301 is a deficient number, since it is larger than the sum of its proper divisors (1).
224120150413301 is an equidigital number, since it uses as much as digits as its factorization.
224120150413301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 29.
The spelling of 224120150413301 in words is "two hundred twenty-four trillion, one hundred twenty billion, one hundred fifty million, four hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •