Base | Representation |
---|---|
bin | 11101110110100000001… |
… | …00110110110011000001 |
3 | 10122001111022121200220001 |
4 | 32323100010312303001 |
5 | 113301104421303101 |
6 | 2103110311520001 |
7 | 134050426633033 |
oct | 16732004666301 |
9 | 3561438550801 |
10 | 1025693150401 |
11 | 365aa3053097 |
12 | 146952689001 |
13 | 759512b380a |
14 | 379028a3c53 |
15 | 1ba32206901 |
hex | eed0136cc1 |
1025693150401 has 2 divisors, whose sum is σ = 1025693150402. Its totient is φ = 1025693150400.
The previous prime is 1025693150381. The next prime is 1025693150411. The reversal of 1025693150401 is 1040513965201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 760385744001 + 265307406400 = 872001^2 + 515080^2 .
It is a cyclic number.
It is not a de Polignac number, because 1025693150401 - 25 = 1025693150369 is a prime.
It is not a weakly prime, because it can be changed into another prime (1025693150411) 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, 512846575200 + 512846575201.
It is an arithmetic number, because the mean of its divisors is an integer number (512846575201).
Almost surely, 21025693150401 is an apocalyptic number.
It is an amenable number.
1025693150401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1025693150401 is an equidigital number, since it uses as much as digits as its factorization.
1025693150401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 37.
The spelling of 1025693150401 in words is "one trillion, twenty-five billion, six hundred ninety-three million, one hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •