Base | Representation |
---|---|
bin | 110001000111101001… |
… | …1001111011110110101 |
3 | 101002021022121222111212 |
4 | 1202033103033132311 |
5 | 3212012222314031 |
6 | 120243003211205 |
7 | 10422656054516 |
oct | 1421723173665 |
9 | 332238558455 |
10 | 105483401141 |
11 | 4080a6a2588 |
12 | 1853a216b05 |
13 | 9c408610c1 |
14 | 51693d6a0d |
15 | 2b2582b12b |
hex | 188f4cf7b5 |
105483401141 has 2 divisors, whose sum is σ = 105483401142. Its totient is φ = 105483401140.
The previous prime is 105483401131. The next prime is 105483401267. The reversal of 105483401141 is 141104384501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72266880625 + 33216520516 = 268825^2 + 182254^2 .
It is a cyclic number.
It is not a de Polignac number, because 105483401141 - 26 = 105483401077 is a prime.
It is a super-2 number, since 2×1054834011412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105483401098 and 105483401107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105483401131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52741700570 + 52741700571.
It is an arithmetic number, because the mean of its divisors is an integer number (52741700571).
Almost surely, 2105483401141 is an apocalyptic number.
It is an amenable number.
105483401141 is a deficient number, since it is larger than the sum of its proper divisors (1).
105483401141 is an equidigital number, since it uses as much as digits as its factorization.
105483401141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7680, while the sum is 32.
Adding to 105483401141 its reverse (141104384501), we get a palindrome (246587785642).
The spelling of 105483401141 in words is "one hundred five billion, four hundred eighty-three million, four hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •