Base | Representation |
---|---|
bin | 100110110001100… |
… | …0000100101010111 |
3 | 10100200002211010101 |
4 | 1031203000211113 |
5 | 10131030214223 |
6 | 333033234531 |
7 | 44145341104 |
oct | 11543004527 |
9 | 3320084111 |
10 | 1301023063 |
11 | 60843697a |
12 | 303862a47 |
13 | 179705842 |
14 | c4b09aab |
15 | 793434ad |
hex | 4d8c0957 |
1301023063 has 2 divisors, whose sum is σ = 1301023064. Its totient is φ = 1301023062.
The previous prime is 1301023057. The next prime is 1301023123. The reversal of 1301023063 is 3603201031.
It is a weak prime.
It is an emirp because it is prime and its reverse (3603201031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1301023063 - 221 = 1298925911 is a prime.
It is a super-3 number, since 3×13010230633 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1301023063.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1301021063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650511531 + 650511532.
It is an arithmetic number, because the mean of its divisors is an integer number (650511532).
Almost surely, 21301023063 is an apocalyptic number.
1301023063 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301023063 is an equidigital number, since it uses as much as digits as its factorization.
1301023063 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 19.
The square root of 1301023063 is about 36069.6972956525. The cubic root of 1301023063 is about 1091.6791063698.
Adding to 1301023063 its reverse (3603201031), we get a palindrome (4904224094).
The spelling of 1301023063 in words is "one billion, three hundred one million, twenty-three thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •