Base | Representation |
---|---|
bin | 1110110000011111000… |
… | …0100100011100001111 |
3 | 220020102011112012112201 |
4 | 3230013300210130033 |
5 | 13123214002240101 |
6 | 312245505142331 |
7 | 24213535003126 |
oct | 3540760443417 |
9 | 806364465481 |
10 | 253533243151 |
11 | 985829a7111 |
12 | 4117792a9a7 |
13 | 1aba6097706 |
14 | c3b1b84abd |
15 | 68dd0e0e01 |
hex | 3b07c2470f |
253533243151 has 2 divisors, whose sum is σ = 253533243152. Its totient is φ = 253533243150.
The previous prime is 253533243149. The next prime is 253533243193. The reversal of 253533243151 is 151342335352.
253533243151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 253533243151 - 21 = 253533243149 is a prime.
Together with 253533243149, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 253533243151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (253533243851) 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, 126766621575 + 126766621576.
It is an arithmetic number, because the mean of its divisors is an integer number (126766621576).
Almost surely, 2253533243151 is an apocalyptic number.
253533243151 is a deficient number, since it is larger than the sum of its proper divisors (1).
253533243151 is an equidigital number, since it uses as much as digits as its factorization.
253533243151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 162000, while the sum is 37.
The spelling of 253533243151 in words is "two hundred fifty-three billion, five hundred thirty-three million, two hundred forty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •