Base | Representation |
---|---|
bin | 1001011001011010111110… |
… | …0010100100000001100001 |
3 | 1100120202120122020122112122 |
4 | 2112112233202210001201 |
5 | 2323241113400421004 |
6 | 33550340115034025 |
7 | 2114326023661361 |
oct | 226265742440141 |
9 | 40522518218478 |
10 | 10332341420129 |
11 | 3323a15405a03 |
12 | 11aa58829b915 |
13 | 59c449467401 |
14 | 27a13364a9a1 |
15 | 12db7ba7ecbe |
hex | 965af8a4061 |
10332341420129 has 2 divisors, whose sum is σ = 10332341420130. Its totient is φ = 10332341420128.
The previous prime is 10332341420117. The next prime is 10332341420143. The reversal of 10332341420129 is 92102414323301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9708533685904 + 623807734225 = 3115852^2 + 789815^2 .
It is a cyclic number.
It is not a de Polignac number, because 10332341420129 - 24 = 10332341420113 is a prime.
It is a super-2 number, since 2×103323414201292 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10332331420129) 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, 5166170710064 + 5166170710065.
It is an arithmetic number, because the mean of its divisors is an integer number (5166170710065).
Almost surely, 210332341420129 is an apocalyptic number.
It is an amenable number.
10332341420129 is a deficient number, since it is larger than the sum of its proper divisors (1).
10332341420129 is an equidigital number, since it uses as much as digits as its factorization.
10332341420129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 35.
The spelling of 10332341420129 in words is "ten trillion, three hundred thirty-two billion, three hundred forty-one million, four hundred twenty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •