Base | Representation |
---|---|
bin | 1001001000100101001011… |
… | …1001011100110110000101 |
3 | 1022120002210122002200022102 |
4 | 2102021102321130312011 |
5 | 2304021103212030432 |
6 | 33205411321441445 |
7 | 2054404335203132 |
oct | 222112271346605 |
9 | 38502718080272 |
10 | 10043024330117 |
11 | 322224a460039 |
12 | 11624a4640285 |
13 | 57b08c96061c |
14 | 26a129237589 |
15 | 1263971c7962 |
hex | 92252e5cd85 |
10043024330117 has 2 divisors, whose sum is σ = 10043024330118. Its totient is φ = 10043024330116.
The previous prime is 10043024330069. The next prime is 10043024330159. The reversal of 10043024330117 is 71103342034001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6053892937156 + 3989131392961 = 2460466^2 + 1997281^2 .
It is a cyclic number.
It is not a de Polignac number, because 10043024330117 - 28 = 10043024329861 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10043024330117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10043024333117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5021512165058 + 5021512165059.
It is an arithmetic number, because the mean of its divisors is an integer number (5021512165059).
Almost surely, 210043024330117 is an apocalyptic number.
It is an amenable number.
10043024330117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10043024330117 is an equidigital number, since it uses as much as digits as its factorization.
10043024330117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 10043024330117 its reverse (71103342034001), we get a palindrome (81146366364118).
The spelling of 10043024330117 in words is "ten trillion, forty-three billion, twenty-four million, three hundred thirty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •