Base | Representation |
---|---|
bin | 1001010100000111001000… |
… | …0101010101110001111111 |
3 | 1100021001002222120222201012 |
4 | 2111001302011111301333 |
5 | 2320242301201124343 |
6 | 33440412002305435 |
7 | 2104616255005112 |
oct | 225016205256177 |
9 | 40231088528635 |
10 | 10241116036223 |
11 | 3299262020846 |
12 | 119496905827b |
13 | 59396b803ac7 |
14 | 27595bad2579 |
15 | 12b5dcd51718 |
hex | 95072155c7f |
10241116036223 has 2 divisors, whose sum is σ = 10241116036224. Its totient is φ = 10241116036222.
The previous prime is 10241116036187. The next prime is 10241116036231. The reversal of 10241116036223 is 32263061114201.
10241116036223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (32263061114201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10241116036223 - 218 = 10241115774079 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10241116036223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10241116036253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5120558018111 + 5120558018112.
It is an arithmetic number, because the mean of its divisors is an integer number (5120558018112).
Almost surely, 210241116036223 is an apocalyptic number.
10241116036223 is a deficient number, since it is larger than the sum of its proper divisors (1).
10241116036223 is an equidigital number, since it uses as much as digits as its factorization.
10241116036223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 10241116036223 in words is "ten trillion, two hundred forty-one billion, one hundred sixteen million, thirty-six thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •