Base | Representation |
---|---|
bin | 1010001010010101011… |
… | …11100000000101001011 |
3 | 1020101012121101121121221 |
4 | 11011022233200011023 |
5 | 21210022424122011 |
6 | 424221241142511 |
7 | 34140112504633 |
oct | 5051257400513 |
9 | 1211177347557 |
10 | 349146317131 |
11 | 125087aa2817 |
12 | 5780048aa37 |
13 | 26c02a70c31 |
14 | 12c823316c3 |
15 | 9137125971 |
hex | 514abe014b |
349146317131 has 2 divisors, whose sum is σ = 349146317132. Its totient is φ = 349146317130.
The previous prime is 349146317123. The next prime is 349146317159. The reversal of 349146317131 is 131713641943.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 349146317131 - 23 = 349146317123 is a prime.
It is a super-2 number, since 2×3491463171312 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (349146317171) 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, 174573158565 + 174573158566.
It is an arithmetic number, because the mean of its divisors is an integer number (174573158566).
Almost surely, 2349146317131 is an apocalyptic number.
349146317131 is a deficient number, since it is larger than the sum of its proper divisors (1).
349146317131 is an equidigital number, since it uses as much as digits as its factorization.
349146317131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 163296, while the sum is 43.
The spelling of 349146317131 in words is "three hundred forty-nine billion, one hundred forty-six million, three hundred seventeen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •