Base | Representation |
---|---|
bin | 110001000110101010… |
… | …0000001011100001101 |
3 | 101002011222212122012002 |
4 | 1202031110001130031 |
5 | 3211430203120331 |
6 | 120235412322045 |
7 | 10422102435005 |
oct | 1421524013415 |
9 | 332158778162 |
10 | 105450051341 |
11 | 407a2894368 |
12 | 1852b013325 |
13 | 9c369854ab |
14 | 5164bd5005 |
15 | 2b2293e9cb |
hex | 188d50170d |
105450051341 has 4 divisors (see below), whose sum is σ = 105454106784. Its totient is φ = 105445995900.
The previous prime is 105450051299. The next prime is 105450051353. The reversal of 105450051341 is 143150054501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 143150054501 = 1601 ⋅89412901.
It is a cyclic number.
It is not a de Polignac number, because 105450051341 - 214 = 105450034957 is a prime.
It is a super-2 number, since 2×1054500513412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105450050341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1988465 + ... + 2040806.
It is an arithmetic number, because the mean of its divisors is an integer number (26363526696).
Almost surely, 2105450051341 is an apocalyptic number.
It is an amenable number.
105450051341 is a deficient number, since it is larger than the sum of its proper divisors (4055443).
105450051341 is an equidigital number, since it uses as much as digits as its factorization.
105450051341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4055442.
The product of its (nonzero) digits is 6000, while the sum is 29.
The spelling of 105450051341 in words is "one hundred five billion, four hundred fifty million, fifty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •