Base | Representation |
---|---|
bin | 11110010011111101101100… |
… | …100111001011101000010011 |
3 | 122111000121221221021220101202 |
4 | 132103331230213023220103 |
5 | 114433201130400023443 |
6 | 1151311142355221415 |
7 | 40036366103026634 |
oct | 3623755447135023 |
9 | 574017857256352 |
10 | 133313312111123 |
11 | 39528949241331 |
12 | 12b5101a5a786b |
13 | 5950511b63c01 |
14 | 24cc5821a988b |
15 | 1062bba0007b8 |
hex | 793f6c9cba13 |
133313312111123 has 2 divisors, whose sum is σ = 133313312111124. Its totient is φ = 133313312111122.
The previous prime is 133313312111069. The next prime is 133313312111129. The reversal of 133313312111123 is 321111213313331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133313312111123 - 222 = 133313307916819 is a prime.
It is a super-2 number, since 2×1333133121111232 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (133313312111129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66656656055561 + 66656656055562.
It is an arithmetic number, because the mean of its divisors is an integer number (66656656055562).
Almost surely, 2133313312111123 is an apocalyptic number.
133313312111123 is a deficient number, since it is larger than the sum of its proper divisors (1).
133313312111123 is an equidigital number, since it uses as much as digits as its factorization.
133313312111123 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2916, while the sum is 29.
Adding to 133313312111123 its reverse (321111213313331), we get a palindrome (454424525424454).
The spelling of 133313312111123 in words is "one hundred thirty-three trillion, three hundred thirteen billion, three hundred twelve million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •