Base | Representation |
---|---|
bin | 1001011000010000110011… |
… | …0111100001101100100101 |
3 | 1100111212012010211121122202 |
4 | 2112010030313201230211 |
5 | 2322424330141011404 |
6 | 33533244354504245 |
7 | 2113022454524066 |
oct | 226041467415445 |
9 | 40455163747582 |
10 | 10312432360229 |
11 | 331652924a59a |
12 | 11a6750895085 |
13 | 59a5c58805ac |
14 | 2791a547856d |
15 | 12d3b3cc921e |
hex | 9610cde1b25 |
10312432360229 has 2 divisors, whose sum is σ = 10312432360230. Its totient is φ = 10312432360228.
The previous prime is 10312432360187. The next prime is 10312432360273. The reversal of 10312432360229 is 92206323421301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8939340556129 + 1373091804100 = 2989873^2 + 1171790^2 .
It is a cyclic number.
It is not a de Polignac number, because 10312432360229 - 216 = 10312432294693 is a prime.
It is a super-2 number, since 2×103124323602292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10312432360192 and 10312432360201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10312432360289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156216180114 + 5156216180115.
It is an arithmetic number, because the mean of its divisors is an integer number (5156216180115).
Almost surely, 210312432360229 is an apocalyptic number.
It is an amenable number.
10312432360229 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312432360229 is an equidigital number, since it uses as much as digits as its factorization.
10312432360229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 93312, while the sum is 38.
The spelling of 10312432360229 in words is "ten trillion, three hundred twelve billion, four hundred thirty-two million, three hundred sixty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.215 sec. • engine limits •