Base | Representation |
---|---|
bin | 1110110110011100010… |
… | …0101001001100001011 |
3 | 220101112121111210102002 |
4 | 3231213010221030023 |
5 | 13140002334403003 |
6 | 313112311301215 |
7 | 24301263055031 |
oct | 3554704511413 |
9 | 811477453362 |
10 | 255132341003 |
11 | 99223611a91 |
12 | 4154337a80b |
13 | 1b09c475967 |
14 | c4c42c2551 |
15 | 69836b2a88 |
hex | 3b6712930b |
255132341003 has 2 divisors, whose sum is σ = 255132341004. Its totient is φ = 255132341002.
The previous prime is 255132340919. The next prime is 255132341077. The reversal of 255132341003 is 300143231552.
It is a happy number.
255132341003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 255132341003 - 222 = 255128146699 is a prime.
It is a super-2 number, since 2×2551323410032 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (255132341203) 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, 127566170501 + 127566170502.
It is an arithmetic number, because the mean of its divisors is an integer number (127566170502).
Almost surely, 2255132341003 is an apocalyptic number.
255132341003 is a deficient number, since it is larger than the sum of its proper divisors (1).
255132341003 is an equidigital number, since it uses as much as digits as its factorization.
255132341003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 255132341003 its reverse (300143231552), we get a palindrome (555275572555).
The spelling of 255132341003 in words is "two hundred fifty-five billion, one hundred thirty-two million, three hundred forty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •