Base | Representation |
---|---|
bin | 1000110100101001011… |
… | …11010001001101110001 |
3 | 1001222110120021120111012 |
4 | 10122110233101031301 |
5 | 14431314120124334 |
6 | 351132333200305 |
7 | 30621112042511 |
oct | 4322457211561 |
9 | 1058416246435 |
10 | 303143129969 |
11 | 107620437379 |
12 | 4a902030095 |
13 | 22781078024 |
14 | 1095a765841 |
15 | 7d435c69ce |
hex | 4694bd1371 |
303143129969 has 2 divisors, whose sum is σ = 303143129970. Its totient is φ = 303143129968.
The previous prime is 303143129921. The next prime is 303143130011. The reversal of 303143129969 is 969921341303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 281761379344 + 21381750625 = 530812^2 + 146225^2 .
It is an emirp because it is prime and its reverse (969921341303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 303143129969 - 228 = 302874694513 is a prime.
It is a super-2 number, since 2×3031431299692 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (303143129369) 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, 151571564984 + 151571564985.
It is an arithmetic number, because the mean of its divisors is an integer number (151571564985).
Almost surely, 2303143129969 is an apocalyptic number.
It is an amenable number.
303143129969 is a deficient number, since it is larger than the sum of its proper divisors (1).
303143129969 is an equidigital number, since it uses as much as digits as its factorization.
303143129969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 944784, while the sum is 50.
The spelling of 303143129969 in words is "three hundred three billion, one hundred forty-three million, one hundred twenty-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •