Base | Representation |
---|---|
bin | 1010100100100111100100… |
… | …0111001010010000001001 |
3 | 1112011021010102100001222021 |
4 | 2221021321013022100021 |
5 | 3010422342114014423 |
6 | 40420031231324441 |
7 | 2306551562553544 |
oct | 251117107122011 |
9 | 45137112301867 |
10 | 11624213423113 |
11 | 378188a486695 |
12 | 1378a25680721 |
13 | 66420a654855 |
14 | 2c288752d85b |
15 | 15258c12495d |
hex | a92791ca409 |
11624213423113 has 2 divisors, whose sum is σ = 11624213423114. Its totient is φ = 11624213423112.
The previous prime is 11624213423107. The next prime is 11624213423117. The reversal of 11624213423113 is 31132431242611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7725436804089 + 3898776619024 = 2779467^2 + 1974532^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11624213423113 is a prime.
It is a super-2 number, since 2×116242134231132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11624213423117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5812106711556 + 5812106711557.
It is an arithmetic number, because the mean of its divisors is an integer number (5812106711557).
Almost surely, 211624213423113 is an apocalyptic number.
It is an amenable number.
11624213423113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11624213423113 is an equidigital number, since it uses as much as digits as its factorization.
11624213423113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 20736, while the sum is 34.
Adding to 11624213423113 its reverse (31132431242611), we get a palindrome (42756644665724).
The spelling of 11624213423113 in words is "eleven trillion, six hundred twenty-four billion, two hundred thirteen million, four hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •