Base | Representation |
---|---|
bin | 110000111010110000… |
… | …1110011010110010101 |
3 | 101001011012000020222221 |
4 | 1201311201303112111 |
5 | 3210121024313303 |
6 | 120132035422341 |
7 | 10406155566334 |
oct | 1416541632625 |
9 | 331135006887 |
10 | 105051010453 |
11 | 40608614004 |
12 | 184394549b1 |
13 | 9ba20bb61c |
14 | 5127bddd1b |
15 | 2aec8ba4bd |
hex | 1875873595 |
105051010453 has 2 divisors, whose sum is σ = 105051010454. Its totient is φ = 105051010452.
The previous prime is 105051010429. The next prime is 105051010481. The reversal of 105051010453 is 354010150501.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75238844209 + 29812166244 = 274297^2 + 172662^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105051010453 is a prime.
It is a super-2 number, since 2×1050510104532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105051011453) 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, 52525505226 + 52525505227.
It is an arithmetic number, because the mean of its divisors is an integer number (52525505227).
Almost surely, 2105051010453 is an apocalyptic number.
It is an amenable number.
105051010453 is a deficient number, since it is larger than the sum of its proper divisors (1).
105051010453 is an equidigital number, since it uses as much as digits as its factorization.
105051010453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 105051010453 its reverse (354010150501), we get a palindrome (459061160954).
The spelling of 105051010453 in words is "one hundred five billion, fifty-one million, ten thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •