Base | Representation |
---|---|
bin | 1001001110011010011101… |
… | …1001010111111010000101 |
3 | 1022220200102212122201111102 |
4 | 2103212213121113322011 |
5 | 2312141311403414303 |
6 | 33323422300145445 |
7 | 2064552413261156 |
oct | 223464731277205 |
9 | 38820385581442 |
10 | 10143226232453 |
11 | 3260799858376 |
12 | 11799a9b38285 |
13 | 58766b2421b2 |
14 | 270d1301392d |
15 | 128cadee5288 |
hex | 939a7657e85 |
10143226232453 has 2 divisors, whose sum is σ = 10143226232454. Its totient is φ = 10143226232452.
The previous prime is 10143226232357. The next prime is 10143226232567. The reversal of 10143226232453 is 35423262234101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5946370036324 + 4196856196129 = 2438518^2 + 2048623^2 .
It is a cyclic number.
It is not a de Polignac number, because 10143226232453 - 216 = 10143226166917 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10143226235453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071613116226 + 5071613116227.
It is an arithmetic number, because the mean of its divisors is an integer number (5071613116227).
Almost surely, 210143226232453 is an apocalyptic number.
It is an amenable number.
10143226232453 is a deficient number, since it is larger than the sum of its proper divisors (1).
10143226232453 is an equidigital number, since it uses as much as digits as its factorization.
10143226232453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 207360, while the sum is 38.
Adding to 10143226232453 its reverse (35423262234101), we get a palindrome (45566488466554).
The spelling of 10143226232453 in words is "ten trillion, one hundred forty-three billion, two hundred twenty-six million, two hundred thirty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •