Base | Representation |
---|---|
bin | 11001110100001001101101… |
… | …011111001101011011110111 |
3 | 112212222211200112012221121112 |
4 | 121310021231133031123313 |
5 | 104340124141103304003 |
6 | 1041245132101305235 |
7 | 32625430125245225 |
oct | 3164115537153367 |
9 | 485884615187545 |
10 | 113535002400503 |
11 | 331a2a19004992 |
12 | 10897a1670521b |
13 | 4b473c68035c8 |
14 | 20071a29cdb15 |
15 | d1d48c9413d8 |
hex | 67426d7cd6f7 |
113535002400503 has 2 divisors, whose sum is σ = 113535002400504. Its totient is φ = 113535002400502.
The previous prime is 113535002400437. The next prime is 113535002400539. The reversal of 113535002400503 is 305004200535311.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 113535002400503 - 210 = 113535002399479 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113535002400503.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113535002400553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56767501200251 + 56767501200252.
It is an arithmetic number, because the mean of its divisors is an integer number (56767501200252).
Almost surely, 2113535002400503 is an apocalyptic number.
113535002400503 is a deficient number, since it is larger than the sum of its proper divisors (1).
113535002400503 is an equidigital number, since it uses as much as digits as its factorization.
113535002400503 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 32.
Adding to 113535002400503 its reverse (305004200535311), we get a palindrome (418539202935814).
The spelling of 113535002400503 in words is "one hundred thirteen trillion, five hundred thirty-five billion, two million, four hundred thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •