Base | Representation |
---|---|
bin | 10111111110100000011011… |
… | …100110110011111101011101 |
3 | 111211100222011200001112011022 |
4 | 113332200123212303331131 |
5 | 102310200111023214100 |
6 | 1012135142510133525 |
7 | 31132355461413041 |
oct | 2776403346637535 |
9 | 454328150045138 |
10 | 105450500210525 |
11 | 30666340309708 |
12 | b9b101b1b12a5 |
13 | 46abc2a115102 |
14 | 1c07b8d69a021 |
15 | c2d022139e85 |
hex | 5fe81b9b3f5d |
105450500210525 has 6 divisors (see below), whose sum is σ = 130758620261082. Its totient is φ = 84360400168400.
The previous prime is 105450500210453. The next prime is 105450500210579. The reversal of 105450500210525 is 525012005054501.
It can be written as a sum of positive squares in 3 ways, for example, as 3801618651076 + 101648881559449 = 1949774^2 + 10082107^2 .
It is not a de Polignac number, because 105450500210525 - 28 = 105450500210269 is a prime.
It is a super-2 number, since 2×1054505002105252 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2109010004186 + ... + 2109010004235.
It is an arithmetic number, because the mean of its divisors is an integer number (21793103376847).
Almost surely, 2105450500210525 is an apocalyptic number.
It is an amenable number.
105450500210525 is a deficient number, since it is larger than the sum of its proper divisors (25308120050557).
105450500210525 is an equidigital number, since it uses as much as digits as its factorization.
105450500210525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4218020008431 (or 4218020008426 counting only the distinct ones).
The product of its (nonzero) digits is 50000, while the sum is 35.
The spelling of 105450500210525 in words is "one hundred five trillion, four hundred fifty billion, five hundred million, two hundred ten thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •