Base | Representation |
---|---|
bin | 1001001101100101110000… |
… | …0000001010001000011101 |
3 | 1022212022220202022020200111 |
4 | 2103121130000022020131 |
5 | 2311423322031214331 |
6 | 33313122232530021 |
7 | 2063541646032652 |
oct | 223313400121035 |
9 | 38768822266614 |
10 | 10129076429341 |
11 | 3255798641911 |
12 | 11770bb250911 |
13 | 5862248a2c2c |
14 | 27036daa3c29 |
15 | 128731b70db1 |
hex | 9365c00a21d |
10129076429341 has 2 divisors, whose sum is σ = 10129076429342. Its totient is φ = 10129076429340.
The previous prime is 10129076429333. The next prime is 10129076429393. The reversal of 10129076429341 is 14392467092101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7581927460900 + 2547148968441 = 2753530^2 + 1595979^2 .
It is a cyclic number.
It is not a de Polignac number, because 10129076429341 - 23 = 10129076429333 is a prime.
It is a super-2 number, since 2×101290764293412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10129076420341) 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, 5064538214670 + 5064538214671.
It is an arithmetic number, because the mean of its divisors is an integer number (5064538214671).
Almost surely, 210129076429341 is an apocalyptic number.
It is an amenable number.
10129076429341 is a deficient number, since it is larger than the sum of its proper divisors (1).
10129076429341 is an equidigital number, since it uses as much as digits as its factorization.
10129076429341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184, while the sum is 49.
The spelling of 10129076429341 in words is "ten trillion, one hundred twenty-nine billion, seventy-six million, four hundred twenty-nine thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •