Base | Representation |
---|---|
bin | 1010000000011010110011… |
… | …1001111000111001010101 |
3 | 1102221210220001021121020212 |
4 | 2200012230321320321111 |
5 | 2420230213344221321 |
6 | 35222220431535205 |
7 | 2213614356546032 |
oct | 240065471707125 |
9 | 42853801247225 |
10 | 11002312101461 |
11 | 3562066395a6a |
12 | 12983a408a505 |
13 | 61a68a445425 |
14 | 2a072c674389 |
15 | 1412de66b55b |
hex | a01ace78e55 |
11002312101461 has 2 divisors, whose sum is σ = 11002312101462. Its totient is φ = 11002312101460.
The previous prime is 11002312101409. The next prime is 11002312101467. The reversal of 11002312101461 is 16410121320011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9365319798961 + 1636992302500 = 3060281^2 + 1279450^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002312101461 - 238 = 10727434194517 is a prime.
It is a super-3 number, since 3×110023121014613 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11002312101467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501156050730 + 5501156050731.
It is an arithmetic number, because the mean of its divisors is an integer number (5501156050731).
Almost surely, 211002312101461 is an apocalyptic number.
It is an amenable number.
11002312101461 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002312101461 is an equidigital number, since it uses as much as digits as its factorization.
11002312101461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 11002312101461 its reverse (16410121320011), we get a palindrome (27412433421472).
The spelling of 11002312101461 in words is "eleven trillion, two billion, three hundred twelve million, one hundred one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •