Base | Representation |
---|---|
bin | 11101011111000110101… |
… | …00010011011000000001 |
3 | 10120212001211211122002121 |
4 | 32233203110103120001 |
5 | 113044343023033313 |
6 | 2053232002444241 |
7 | 133124221650616 |
oct | 16574324233001 |
9 | 3525054748077 |
10 | 1013131064833 |
11 | 36073708a298 |
12 | 144427663681 |
13 | 746cb8698a4 |
14 | 3707036c50d |
15 | 1b54945728d |
hex | ebe3513601 |
1013131064833 has 2 divisors, whose sum is σ = 1013131064834. Its totient is φ = 1013131064832.
The previous prime is 1013131064821. The next prime is 1013131064849. The reversal of 1013131064833 is 3384601313101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 955265800129 + 57865264704 = 977377^2 + 240552^2 .
It is an emirp because it is prime and its reverse (3384601313101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1013131064833 - 237 = 875692111361 is a prime.
It is not a weakly prime, because it can be changed into another prime (1013131064333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506565532416 + 506565532417.
It is an arithmetic number, because the mean of its divisors is an integer number (506565532417).
Almost surely, 21013131064833 is an apocalyptic number.
It is an amenable number.
1013131064833 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013131064833 is an equidigital number, since it uses as much as digits as its factorization.
1013131064833 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 34.
Adding to 1013131064833 its reverse (3384601313101), we get a palindrome (4397732377934).
The spelling of 1013131064833 in words is "one trillion, thirteen billion, one hundred thirty-one million, sixty-four thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •