Base | Representation |
---|---|
bin | 11101011111000110111… |
… | …00011111110111001101 |
3 | 10120212001222212210000021 |
4 | 32233203130133313031 |
5 | 113044344100310013 |
6 | 2053232120502141 |
7 | 133124246136106 |
oct | 16574334376715 |
9 | 3525058783007 |
10 | 1013133213133 |
11 | 360738317348 |
12 | 14442831a951 |
13 | 746cc13c682 |
14 | 3707076b3ad |
15 | 1b54972da8d |
hex | ebe371fdcd |
1013133213133 has 2 divisors, whose sum is σ = 1013133213134. Its totient is φ = 1013133213132.
The previous prime is 1013133213077. The next prime is 1013133213199. The reversal of 1013133213133 is 3313123313101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 802380603049 + 210752610084 = 895757^2 + 459078^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013133213133 - 29 = 1013133212621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1013133213098 and 1013133213107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013133283133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506566606566 + 506566606567.
It is an arithmetic number, because the mean of its divisors is an integer number (506566606567).
Almost surely, 21013133213133 is an apocalyptic number.
It is an amenable number.
1013133213133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013133213133 is an equidigital number, since it uses as much as digits as its factorization.
1013133213133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 1013133213133 its reverse (3313123313101), we get a palindrome (4326256526234).
The spelling of 1013133213133 in words is "one trillion, thirteen billion, one hundred thirty-three million, two hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •