Base | Representation |
---|---|
bin | 1001010011000100001000… |
… | …0101111000011101001101 |
3 | 1100012022200120120121211112 |
4 | 2110301002011320131031 |
5 | 2314443433014041301 |
6 | 33424235212501405 |
7 | 2103411500516051 |
oct | 224610205703515 |
9 | 40168616517745 |
10 | 10223131002701 |
11 | 3291672a30981 |
12 | 1191389a7a865 |
13 | 592063713836 |
14 | 274b3327dc61 |
15 | 12add8e529bb |
hex | 94c4217874d |
10223131002701 has 2 divisors, whose sum is σ = 10223131002702. Its totient is φ = 10223131002700.
The previous prime is 10223131002673. The next prime is 10223131002719. The reversal of 10223131002701 is 10720013132201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5622423457225 + 4600707545476 = 2371165^2 + 2144926^2 .
It is a cyclic number.
It is not a de Polignac number, because 10223131002701 - 214 = 10223130986317 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10223131002731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111565501350 + 5111565501351.
It is an arithmetic number, because the mean of its divisors is an integer number (5111565501351).
Almost surely, 210223131002701 is an apocalyptic number.
It is an amenable number.
10223131002701 is a deficient number, since it is larger than the sum of its proper divisors (1).
10223131002701 is an equidigital number, since it uses as much as digits as its factorization.
10223131002701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 10223131002701 its reverse (10720013132201), we get a palindrome (20943144134902).
The spelling of 10223131002701 in words is "ten trillion, two hundred twenty-three billion, one hundred thirty-one million, two thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •