Base | Representation |
---|---|
bin | 10011001111111010… |
… | …01000011011000001 |
3 | 222200012021020222201 |
4 | 21213331020123001 |
5 | 132131001404441 |
6 | 4425233433201 |
7 | 514041443065 |
oct | 114775103301 |
9 | 28605236881 |
10 | 10334013121 |
11 | 4423310013 |
12 | 2004a0b801 |
13 | c88c66a83 |
14 | 70066baa5 |
15 | 407389c31 |
hex | 267f486c1 |
10334013121 has 2 divisors, whose sum is σ = 10334013122. Its totient is φ = 10334013120.
The previous prime is 10334013119. The next prime is 10334013133. The reversal of 10334013121 is 12131043301.
10334013121 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., 8942350096 + 1391663025 = 94564^2 + 37305^2 .
It is a cyclic number.
It is not a de Polignac number, because 10334013121 - 21 = 10334013119 is a prime.
Together with 10334013119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10334013101) 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, 5167006560 + 5167006561.
It is an arithmetic number, because the mean of its divisors is an integer number (5167006561).
Almost surely, 210334013121 is an apocalyptic number.
It is an amenable number.
10334013121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10334013121 is an equidigital number, since it uses as much as digits as its factorization.
10334013121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10334013121 its reverse (12131043301), we get a palindrome (22465056422).
The spelling of 10334013121 in words is "ten billion, three hundred thirty-four million, thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •