Base | Representation |
---|---|
bin | 1001010100101100000111… |
… | …0110011001010111011101 |
3 | 1100021222201220020112001211 |
4 | 2111023001312121113131 |
5 | 2320423114310334441 |
6 | 33445133102104421 |
7 | 2105420301163225 |
oct | 225130166312735 |
9 | 40258656215054 |
10 | 10251044230621 |
11 | 32a2497251187 |
12 | 1196879b7b111 |
13 | 59489166c94c |
14 | 2762204c3085 |
15 | 12b9be778a81 |
hex | 952c1d995dd |
10251044230621 has 2 divisors, whose sum is σ = 10251044230622. Its totient is φ = 10251044230620.
The previous prime is 10251044230571. The next prime is 10251044230633. The reversal of 10251044230621 is 12603244015201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10247617416100 + 3426814521 = 3201190^2 + 58539^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10251044230621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10251041230621) 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, 5125522115310 + 5125522115311.
It is an arithmetic number, because the mean of its divisors is an integer number (5125522115311).
Almost surely, 210251044230621 is an apocalyptic number.
It is an amenable number.
10251044230621 is a deficient number, since it is larger than the sum of its proper divisors (1).
10251044230621 is an equidigital number, since it uses as much as digits as its factorization.
10251044230621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 10251044230621 its reverse (12603244015201), we get a palindrome (22854288245822).
The spelling of 10251044230621 in words is "ten trillion, two hundred fifty-one billion, forty-four million, two hundred thirty thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •