Base | Representation |
---|---|
bin | 1010011011110111111000… |
… | …0010000111001101001001 |
3 | 1111121220022211211122001012 |
4 | 2212331332002013031021 |
5 | 3000442143331140013 |
6 | 40223023043133305 |
7 | 2262652503624635 |
oct | 246757602071511 |
9 | 44556284748035 |
10 | 11473972130633 |
11 | 37240a2161971 |
12 | 1353896074235 |
13 | 652cb60c119c |
14 | 2b94b3acbdc5 |
15 | 14d6e72811a8 |
hex | a6f7e087349 |
11473972130633 has 2 divisors, whose sum is σ = 11473972130634. Its totient is φ = 11473972130632.
The previous prime is 11473972130563. The next prime is 11473972130651. The reversal of 11473972130633 is 33603127937411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8929171901584 + 2544800229049 = 2988172^2 + 1595243^2 .
It is an emirp because it is prime and its reverse (33603127937411) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11473972130633 is a prime.
It is not a weakly prime, because it can be changed into another prime (11473972130233) 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, 5736986065316 + 5736986065317.
It is an arithmetic number, because the mean of its divisors is an integer number (5736986065317).
Almost surely, 211473972130633 is an apocalyptic number.
It is an amenable number.
11473972130633 is a deficient number, since it is larger than the sum of its proper divisors (1).
11473972130633 is an equidigital number, since it uses as much as digits as its factorization.
11473972130633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1714608, while the sum is 50.
The spelling of 11473972130633 in words is "eleven trillion, four hundred seventy-three billion, nine hundred seventy-two million, one hundred thirty thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •