Base | Representation |
---|---|
bin | 111000111101111… |
… | …101110101001101 |
3 | 2110121110001102001 |
4 | 320331331311031 |
5 | 3424134040031 |
6 | 234501232301 |
7 | 32453616016 |
oct | 7075756515 |
9 | 2417401361 |
10 | 955768141 |
11 | 450562829 |
12 | 228102691 |
13 | 1230213a3 |
14 | 90d1600d |
15 | 58d95861 |
hex | 38f7dd4d |
955768141 has 2 divisors, whose sum is σ = 955768142. Its totient is φ = 955768140.
The previous prime is 955768139. The next prime is 955768183. The reversal of 955768141 is 141867559.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 854685225 + 101082916 = 29235^2 + 10054^2 .
It is an emirp because it is prime and its reverse (141867559) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 955768141 - 21 = 955768139 is a prime.
Together with 955768139, it forms a pair of twin primes.
It is the 30916-th Hogben number.
It is a junction number, because it is equal to n+sod(n) for n = 955768091 and 955768100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (955768111) by changing a digit.
It is a nontrivial repunit in base 30915.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 477884070 + 477884071.
It is an arithmetic number, because the mean of its divisors is an integer number (477884071).
Almost surely, 2955768141 is an apocalyptic number.
It is an amenable number.
955768141 is a deficient number, since it is larger than the sum of its proper divisors (1).
955768141 is an equidigital number, since it uses as much as digits as its factorization.
955768141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 302400, while the sum is 46.
The square root of 955768141 is about 30915.5000121298. The cubic root of 955768141 is about 985.0331582025.
The spelling of 955768141 in words is "nine hundred fifty-five million, seven hundred sixty-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •