Base | Representation |
---|---|
bin | 10111111110100000011100… |
… | …101000011001011011001101 |
3 | 111211100222012212102000021021 |
4 | 113332200130220121123031 |
5 | 102310200124423401331 |
6 | 1012135144322434141 |
7 | 31132356060510625 |
oct | 2776403450313315 |
9 | 454328185360237 |
10 | 105450517403341 |
11 | 30666349a91950 |
12 | b9b1024b02951 |
13 | 46abc30854886 |
14 | 1c07b91a93885 |
15 | c2d0238d4211 |
hex | 5fe81ca196cd |
105450517403341 has 16 divisors (see below), whose sum is σ = 115162159514688. Its totient is φ = 95759752492800.
The previous prime is 105450517403321. The next prime is 105450517403347. The reversal of 105450517403341 is 143304715054501.
It is a happy number.
It is not a de Polignac number, because 105450517403341 - 27 = 105450517403213 is a prime.
It is a super-2 number, since 2×1054505174033412 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105450517403347) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 486316150 + ... + 486532936.
It is an arithmetic number, because the mean of its divisors is an integer number (7197634969668).
Almost surely, 2105450517403341 is an apocalyptic number.
105450517403341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
105450517403341 is a deficient number, since it is larger than the sum of its proper divisors (9711642111347).
105450517403341 is a wasteful number, since it uses less digits than its factorization.
105450517403341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264732.
The product of its (nonzero) digits is 504000, while the sum is 43.
The spelling of 105450517403341 in words is "one hundred five trillion, four hundred fifty billion, five hundred seventeen million, four hundred three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •