Base | Representation |
---|---|
bin | 11111001101111101… |
… | …000101010111101011 |
3 | 10012112002000011210112 |
4 | 133031331011113223 |
5 | 1022122122110011 |
6 | 23222100204535 |
7 | 2264442155231 |
oct | 371575052753 |
9 | 105462004715 |
10 | 33520113131 |
11 | 1324125913a |
12 | 65b599974b |
13 | 321275448b |
14 | 189db60951 |
15 | d12baa58b |
hex | 7cdf455eb |
33520113131 has 2 divisors, whose sum is σ = 33520113132. Its totient is φ = 33520113130.
The previous prime is 33520113089. The next prime is 33520113161. The reversal of 33520113131 is 13131102533.
It is a strong prime.
It is an emirp because it is prime and its reverse (13131102533) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 33520113131 - 210 = 33520112107 is a prime.
It is a super-2 number, since 2×335201131312 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 33520113097 and 33520113106.
It is not a weakly prime, because it can be changed into another prime (33520113161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16760056565 + 16760056566.
It is an arithmetic number, because the mean of its divisors is an integer number (16760056566).
Almost surely, 233520113131 is an apocalyptic number.
33520113131 is a deficient number, since it is larger than the sum of its proper divisors (1).
33520113131 is an equidigital number, since it uses as much as digits as its factorization.
33520113131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 23.
Adding to 33520113131 its reverse (13131102533), we get a palindrome (46651215664).
The spelling of 33520113131 in words is "thirty-three billion, five hundred twenty million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •