Base | Representation |
---|---|
bin | 1010001001000001000… |
… | …11011001101011101001 |
3 | 1020022101021111212222012 |
4 | 11010200203121223221 |
5 | 21202100224031441 |
6 | 424023114205305 |
7 | 34113426254213 |
oct | 5044043315351 |
9 | 1208337455865 |
10 | 348438502121 |
11 | 1248544a5936 |
12 | 57643423835 |
13 | 26b1c226698 |
14 | 12c163215b3 |
15 | 90e4e0c9eb |
hex | 51208d9ae9 |
348438502121 has 2 divisors, whose sum is σ = 348438502122. Its totient is φ = 348438502120.
The previous prime is 348438502043. The next prime is 348438502123. The reversal of 348438502121 is 121205834843.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 298128012121 + 50310490000 = 546011^2 + 224300^2 .
It is a cyclic number.
It is not a de Polignac number, because 348438502121 - 214 = 348438485737 is a prime.
It is a super-2 number, since 2×3484385021212 (a number of 24 digits) contains 22 as substring.
Together with 348438502123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (348438502123) 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, 174219251060 + 174219251061.
It is an arithmetic number, because the mean of its divisors is an integer number (174219251061).
Almost surely, 2348438502121 is an apocalyptic number.
It is an amenable number.
348438502121 is a deficient number, since it is larger than the sum of its proper divisors (1).
348438502121 is an equidigital number, since it uses as much as digits as its factorization.
348438502121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 184320, while the sum is 41.
The spelling of 348438502121 in words is "three hundred forty-eight billion, four hundred thirty-eight million, five hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •