Base | Representation |
---|---|
bin | 1010011010100010110101… |
… | …1111100000101001101101 |
3 | 1111112201102001112101120111 |
4 | 2212220231133200221231 |
5 | 3000103421341433221 |
6 | 40204330041020021 |
7 | 2261214034252261 |
oct | 246505537405155 |
9 | 44481361471514 |
10 | 11451146046061 |
11 | 3715449459767 |
12 | 134b385784611 |
13 | 650ab9085577 |
14 | 2b834a3520a1 |
15 | 14cd0d376be1 |
hex | a6a2d7e0a6d |
11451146046061 has 2 divisors, whose sum is σ = 11451146046062. Its totient is φ = 11451146046060.
The previous prime is 11451146046023. The next prime is 11451146046071. The reversal of 11451146046061 is 16064064115411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10716129602500 + 735016443561 = 3273550^2 + 857331^2 .
It is a cyclic number.
It is not a de Polignac number, because 11451146046061 - 231 = 11448998562413 is a prime.
It is a super-2 number, since 2×114511460460612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11451146046071) 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, 5725573023030 + 5725573023031.
It is an arithmetic number, because the mean of its divisors is an integer number (5725573023031).
Almost surely, 211451146046061 is an apocalyptic number.
It is an amenable number.
11451146046061 is a deficient number, since it is larger than the sum of its proper divisors (1).
11451146046061 is an equidigital number, since it uses as much as digits as its factorization.
11451146046061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 40.
The spelling of 11451146046061 in words is "eleven trillion, four hundred fifty-one billion, one hundred forty-six million, forty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •