Base | Representation |
---|---|
bin | 110001000110111000… |
… | …1100010111010011101 |
3 | 101002012112102211111002 |
4 | 1202031301202322131 |
5 | 3211434143244441 |
6 | 120240250240045 |
7 | 10422225300341 |
oct | 1421561427235 |
9 | 332175384432 |
10 | 105457790621 |
11 | 407a719aa67 |
12 | 18531726025 |
13 | 9c38465051 |
14 | 5165c4b621 |
15 | 2b2346cb9b |
hex | 188dc62e9d |
105457790621 has 2 divisors, whose sum is σ = 105457790622. Its totient is φ = 105457790620.
The previous prime is 105457790597. The next prime is 105457790623. The reversal of 105457790621 is 126097754501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105446325625 + 11464996 = 324725^2 + 3386^2 .
It is a cyclic number.
It is not a de Polignac number, because 105457790621 - 222 = 105453596317 is a prime.
It is a super-2 number, since 2×1054577906212 (a number of 23 digits) contains 22 as substring.
Together with 105457790623, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105457790623) 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, 52728895310 + 52728895311.
It is an arithmetic number, because the mean of its divisors is an integer number (52728895311).
Almost surely, 2105457790621 is an apocalyptic number.
It is an amenable number.
105457790621 is a deficient number, since it is larger than the sum of its proper divisors (1).
105457790621 is an equidigital number, since it uses as much as digits as its factorization.
105457790621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 529200, while the sum is 47.
The spelling of 105457790621 in words is "one hundred five billion, four hundred fifty-seven million, seven hundred ninety thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •