Base | Representation |
---|---|
bin | 1001110000010000001… |
… | …01001011100110011011 |
3 | 1012001001200201200011112 |
4 | 10320020011023212123 |
5 | 20442333103300201 |
6 | 413543530050535 |
7 | 33133104465332 |
oct | 4701005134633 |
9 | 1161050650145 |
10 | 335143025051 |
11 | 11a15155615a |
12 | 54b52879a4b |
13 | 257b087b7a3 |
14 | 1231463cd19 |
15 | 8ab7a920bb |
hex | 4e0814b99b |
335143025051 has 2 divisors, whose sum is σ = 335143025052. Its totient is φ = 335143025050.
The previous prime is 335143025029. The next prime is 335143025053. The reversal of 335143025051 is 150520341533.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-335143025051 is a prime.
It is a super-2 number, since 2×3351430250512 (a number of 24 digits) contains 22 as substring.
Together with 335143025053, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 335143024999 and 335143025017.
It is not a weakly prime, because it can be changed into another prime (335143025053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 167571512525 + 167571512526.
It is an arithmetic number, because the mean of its divisors is an integer number (167571512526).
Almost surely, 2335143025051 is an apocalyptic number.
335143025051 is a deficient number, since it is larger than the sum of its proper divisors (1).
335143025051 is an equidigital number, since it uses as much as digits as its factorization.
335143025051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 32.
Adding to 335143025051 its reverse (150520341533), we get a palindrome (485663366584).
The spelling of 335143025051 in words is "three hundred thirty-five billion, one hundred forty-three million, twenty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •