Base | Representation |
---|---|
bin | 11010111001010010100… |
… | …00101111101010001101 |
3 | 10021100021211102100212002 |
4 | 31130221100233222031 |
5 | 110120034204132023 |
6 | 1544310321122045 |
7 | 123523212204554 |
oct | 15345120575215 |
9 | 3240254370762 |
10 | 924110224013 |
11 | 326a05147a69 |
12 | 12b122789325 |
13 | 691b2868752 |
14 | 32a27514d9b |
15 | 19089041b28 |
hex | d72942fa8d |
924110224013 has 2 divisors, whose sum is σ = 924110224014. Its totient is φ = 924110224012.
The previous prime is 924110223991. The next prime is 924110224033. The reversal of 924110224013 is 310422011429.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 923592115369 + 518108644 = 961037^2 + 22762^2 .
It is an emirp because it is prime and its reverse (310422011429) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-924110224013 is a prime.
It is a super-2 number, since 2×9241102240132 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (924110224033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 462055112006 + 462055112007.
It is an arithmetic number, because the mean of its divisors is an integer number (462055112007).
Almost surely, 2924110224013 is an apocalyptic number.
It is an amenable number.
924110224013 is a deficient number, since it is larger than the sum of its proper divisors (1).
924110224013 is an equidigital number, since it uses as much as digits as its factorization.
924110224013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The spelling of 924110224013 in words is "nine hundred twenty-four billion, one hundred ten million, two hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •