Base | Representation |
---|---|
bin | 10001100000110010000… |
… | …010000000100001100001 |
3 | 11021001021010021212002012 |
4 | 101200302002000201201 |
5 | 124204111114330423 |
6 | 2320503114202305 |
7 | 152642060114636 |
oct | 21406202004141 |
9 | 4231233255065 |
10 | 1203430230113 |
11 | 42440aa9a811 |
12 | 175296423395 |
13 | 89638166477 |
14 | 42363d2418d |
15 | 21485e15078 |
hex | 11832080861 |
1203430230113 has 2 divisors, whose sum is σ = 1203430230114. Its totient is φ = 1203430230112.
The previous prime is 1203430229927. The next prime is 1203430230127. The reversal of 1203430230113 is 3110320343021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 820605892129 + 382824337984 = 905873^2 + 618728^2 .
It is a cyclic number.
It is not a de Polignac number, because 1203430230113 - 234 = 1186250360929 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1203430230133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 601715115056 + 601715115057.
It is an arithmetic number, because the mean of its divisors is an integer number (601715115057).
Almost surely, 21203430230113 is an apocalyptic number.
It is an amenable number.
1203430230113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1203430230113 is an equidigital number, since it uses as much as digits as its factorization.
1203430230113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1203430230113 its reverse (3110320343021), we get a palindrome (4313750573134).
The spelling of 1203430230113 in words is "one trillion, two hundred three billion, four hundred thirty million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •