Base | Representation |
---|---|
bin | 10010110100011111… |
… | …10010000101101001 |
3 | 222002011111110121002 |
4 | 21122033302011221 |
5 | 131143112140403 |
6 | 4350340124345 |
7 | 505246523126 |
oct | 113217620551 |
9 | 28064443532 |
10 | 10104021353 |
11 | 4315502878 |
12 | 1b5b9966b5 |
13 | c5040b47a |
14 | 6bbcbd74d |
15 | 3e20a9188 |
hex | 25a3f2169 |
10104021353 has 2 divisors, whose sum is σ = 10104021354. Its totient is φ = 10104021352.
The previous prime is 10104021337. The next prime is 10104021379. The reversal of 10104021353 is 35312040101.
10104021353 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7752450304 + 2351571049 = 88048^2 + 48493^2 .
It is a cyclic number.
It is not a de Polignac number, because 10104021353 - 24 = 10104021337 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10104021313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5052010676 + 5052010677.
It is an arithmetic number, because the mean of its divisors is an integer number (5052010677).
Almost surely, 210104021353 is an apocalyptic number.
It is an amenable number.
10104021353 is a deficient number, since it is larger than the sum of its proper divisors (1).
10104021353 is an equidigital number, since it uses as much as digits as its factorization.
10104021353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 10104021353 its reverse (35312040101), we get a palindrome (45416061454).
The spelling of 10104021353 in words is "ten billion, one hundred four million, twenty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •